第二次—B - Number Sequence

B - Number Sequence

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

思路

因为f（n）取值范围是 0-6
系数a，b与7个数搭配有49种
之后就会循环
开一个数组储存这49个值mod 7的余数,
然后输出n%49

代码

#include<stdio.h>
int main(){
	int a,b,n;
	while(scanf("%d%d%d",&a,&b,&n)!=EOF){
		if(a==0&&b==0&&n==0) break;
		int c[50]={0};
		c[0]=1;
		c[1]=1;
		for(int i=2;i<49;i++)
			c[i] = (a*c[i-1]+b*c[i-2])%7;
		printf("%d\n",c[n%49-1]);
	}
	return 0;
}