原题:http://acm.hdu.edu.cn/showproblem.php?pid=1005
思路:
找规律;
当出现两个1 时即找到了循环点;因为f[n]和f[n-1]、f[n-2]有关,所以当出现两个1时后面就全部一样了;
#include<stdio.h>
int a, b, n, i;
int res[100000001];
int main()
{
while(scanf("%d%d%d", &a, &b, &n)!=EOF)
{
if(a == n && b == 0 && n == 0)
break;
res[1] = 1;
res[2] = 1;
for(i = 3;i<10000;i++)
{
res[i] = (a*res[i-1]+b*res[i-2])%7;
if(res[i] == 1 && res[i-1] == 1)
break;
}
n = n%(i-2); //周期就是i-2
res[0] = res[i-2];
printf("%d\n", res[n]);
}
return 0;
}