Number Sequence
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 78 Accepted Submission(s) : 28
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
Author
CHEN, Shunbao
Source
ZJCPC2004
#include<stdio.h>
struct Matrix{
int m[2][2];
};
Matrix mul(Matrix a,Matrix b){
Matrix ans;
for(int i = 0; i < 2; i++){
for(int j = 0; j < 2; j++){
ans.m[i][j] = 0;
for(int k = 0; k < 2; k++){
ans.m[i][j] = (ans.m[i][j] + a.m[i][k] * b.m[k][j] % 7) % 7;
}
}
}
return ans;
}
int main(){
int A,B,n;
while(scanf("%d%d%d",&A,&B,&n) != EOF){
if(A == 0 && B == 0 && n == 0) break;
if(n <= 2){
printf("1\n");
continue;
}
Matrix a,ans;
a.m[0][0] = A;
a.m[0][1] = B;
a.m[1][0] = 1;
a.m[1][1] = 0;
ans.m[0][0] = ans.m[1][1] = 1;
ans.m[0][1] = ans.m[1][0] = 0;
n -= 2;
while(n){
if(n & 1)
ans = mul(ans,a);
n >>= 1;
a = mul(a,a);
}
printf("%d\n",(ans.m[0][0] + ans.m[0][1]) % 7);
}
return 0;
}