Number Sequence

Problem Description

Anumber sequence is defined as follows:

 

f(1) =1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.

 

GivenA, B, and n, you are to calculate the value of f(n).

 

 

Input

Theinput consists of multiple test cases. Each test case contains 3 integers A, Band 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

Foreach 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>
#define Max 100000
int main()
{
	int a,b,n,s,i,j,k=0;
	int f[Max],result[Max];
	f[1]=1;
	f[2]=1;
	while(scanf("%d %d %d",&a,&b,&n)){
		s=0;
		if(a==0&&b==0&&n==0)
			break;
		for(i=3;i<=n;i++){
			f[i]=(a*f[i-1]+b*f[i-2])%7;
			for(j=2;j<i;j++){
				if(f[i]==f[j]&&f[i-1]==f[j-1]){
						s=i-j;
						break;
				}	
			}
			if(s>0)
				break;	
		}
		if(s>0)
			result[k++]=f[(n-j)%s+j];
		else
			result[k++]=f[n];	
	}
	for(i=0;i<k;i++)
		printf("%d\n",result[i]);
	return 0;
}

测试结果：