hdoj 1005Number Sequence
2015-07-26 20:14
369 查看
/*Number Sequence
Problem Description
A number sequence is defined as follows
f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.
Given A, B, and n, you are to calculate the value of f(n).
Input
The input consists of multiple test cases. Each test case contains 3 integers A, B
and n on a single line (1 <= A, B <= 1000, 1 <= n <= 100,000,000).
Three zeros signal the end of input and this test case is not to be processed.
Output
For each test case, print the value of f(n) on a single line.
Sample Input
1 1 3
1 2 10
0 0 0
Sample Output
2
5*/
/*Number Sequence
Problem Description
A number sequence is defined as follows
f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.
Given A, B, and n, you are to calculate the value of f(n).
Input
The input consists of multiple test cases. Each test case contains 3 integers A, B
and n on a single line (1 <= A, B <= 1000, 1 <= n <= 100,000,000).
Three zeros signal the end of input and this test case is not to be processed.
Output
For each test case, print the value of f(n) on a single line.
Sample Input
1 1 3
1 2 10
0 0 0
Sample Output
2
5*/
<span style="font-size:18px;"># include<stdio.h> main() { int f[100]; int a,b,i; int n; while(scanf("%d%d%d",&a,&b,&n),a,b,n) { f[0]=1; f[1]=1; for(i=2;i<48;i++) { f[i]=(a*f[i-1]+b*f[i-2])%7; } n=(n-1)%48; printf("%d\n",f ); } }</span>
相关文章推荐
- Integer Inquiry
- MiniGUI 自定义控件(一)
- 【Prism】MEF版UIComposition
- UVA 10420 List of Conquests
- Altuim designer 导入PCB,出现错误some nets were not able to be matched
- HDUOJ Number Sequence 题目1005
- HDU 1937 J - Justice League
- iOSUI篇--动画(Core Animation)总结
- Taxi Trip Time Winners' Interview: 3rd place, BlueTaxi
- 【瞎搞】 HDU 5312 Sequence
- HDU 5312 Sequence
- Android中多线程编程(三)Handler更新UI的方式
- ListBuffer、ArrayBuffer、Queue、Stack操作代码实战
- leetcode[96]:Unique Binary Search Trees
- 实现Guice下的单元测试中mybatis数据库操作的回滚.
- MiniGui 多窗口程序(一)
- Implement Stack using Queues && Implement Queue using Stacks (LeetCode)
- leetcode第225题:Implement Stacks using Queues
- easyui searchbox
- UESTC 250 windy数(数位DP)