Number Sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 153828 Accepted Submission(s): 37539
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).
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思路:打表找规律,a,b固定,mod7后只有0,1,2,3,4,5,6这几位数字,所以最长的周期是49,,也就是说第50个会是第一个,不排除在50前就循环#include<stdio.h> long long int f[60]; int main() { int a,b,n; while(scanf("%d%d%d",&a,&b,&n)!=-1) { if(a==0&&b==0&&n==0) break; f[1]=1; f[2]=1; int i; for(i=3; i<=50; i++) { f[i]=(a*f[i-1]+b*f[i-2])%7; if(f[i]==1&&f[i-1]==1) break; } n=n%(i-2); if(n==0) printf("%d\n",f[i-2]); else printf("%d\n",f[n]); } }