Number Sequence——杭电1005分析和总结.docxVIP

Number Sequence——杭电 1005 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 #includeiostream using namespace std; int d[100]; int int sequence(int a,int b,int n){ if( if(d[n]!=0) return d[n]; if if(n==2||n==1) return 1; return 1; d[n]=(a*sequence(a,b,n-1)+b*sequence(a,b,n-2))%7; return d[n]; } int int main() { int a,b,n; while(cinabn){ if(a==0b==0n==0) break;memset break; memset(d,0,100*sizeof(int)); coutsequence(a,b,n%49)endl; } return 0; }