Problem K
Time Limit: 1000 MS Memory Limit: 32 MB 64bit IO Format: %I64d
Submitted: 225 Accepted: 51
[Submit][Status][Web Board]
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
由于mod7,f(n)的取值只可能在0-6中取值,而A和B不变,所以必然会循环,且循环节不会超过7*7=49;
#include <stdio.h>
int main()
{
long long a,b,n,i,s,q,p;
while(scanf("%I64d%I64d%I64d",&a,&b,&n)!=EOF)
{
if(a==0&&b==0&&n==0)
break;
p=1;
q=1;
if(n==1||n==2)
printf("1\n");
else
{
n=n%49;
for(i=3; i<=n; i++)
{
s=(a*q+b*p)%7;
p=q;
q=s;
}
printf("%I64d\n",s);
}
}
return 0;
}