杭电HDU 1005 Number Sequence (找循环)

Number Sequence

题目：https://acm.hdu.edu.cn/showproblem.php?pid=1005

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

AC代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int f[1006];//直接做数据太大，会超时，找循环规律
	f[1]=1;
	f[2]=1;
	int a,b,n;
	while(scanf("%d %d %d",&a,&b,&n)){
		if(a==0||b==0||n==0) break;
		int i=3;
		for(;i<=1000;i++){
			f[i]=(f[i-1]*a+f[i-2]*b)%7;
			if(f[i]==1&&f[i-1]==1) break;
		}
		int t=i-2;
		f[0]=f[t];
		printf("%d\n",f[n%t]);
	}
	return 0;
}