递推寻找循环节 杭电1005
Number Sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 133941 Accepted Submission(s): 32537
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
#include<stdio.h>
#include<string.h>
int f[1000000];
using namespace std;
int main()
{
int a,b,n;
while(~scanf("%d%d%d",&a,&b,&n))
{
if(a==0&&b==0&&n==0)break;
f[1]=1;
f[2]=1;
int i;
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;//利用break来找到循环节
}
n=n%(i-2);
f[0]=f[i-2];//这道题的坑点在f0的确定.题意说的是f1=1,
//f2=1但是没有说明f0是多少 所以f0是一个坑点 如果长大了的我再看到
//这个题 能想起来自然最好.
printf("%d\n",f[n]);
}
}