Number Sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 104109 Accepted Submission(s): 25211
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).
AC CODE:
#include<stdio.h>
#include<string.h>
int f[1000]={0,1,1};
int main()
{
int a,b,n,i,j;
while(scanf("%d%d%d",&a,&b,&n),a||b||n)
{
for(i=3;i<1000;i++)
{
f[i]=(a*f[i-1]+b*f[i-2])%7;
if(f[i]==1&&f[i-1]==1)
break;
}
i=i-2;
n%=i;
if(!n)
printf("%d\n",f[i]);
else
printf("%d\n",f[n]);
}
return 0;
}