杭电acm1005

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
   
   
题目分析：
   
   
f(n)的值肯定是0~6，而f(n-1)和f(n-1）组合共有7*7=49种不同的情况，所以定义一个数组m0[101]由于1<=n<=100000000,n的取值可能很大，所以需要计算f(n)函数的周期，找到两个相同的循环节，即可计算出。如果mo[j-1]=m0[i-1],m0[j]=mo[i],则周期T=i-j;n=n%T,将n再次进入一层循环计算。
   
   
开始时我以为这是一个简单的递归算法，由于n的值很大，要计算的次数太多，太慢，超出时间限制，百度说会溢出堆栈。长
   
   
注意：需要用长整形定义n;
   
   


   
   
我的代码：
   
   
#include<stdio.h>
int main(){
    int i,j;
    long int mo[101],a,b,n,t;
	while(scanf("%ld%ld%ld",&a,&b,&n)!=EOF)
	{   
	    if(a==0&&b==0&&n==0)
	    break;
		mo[0]=1;
		mo[1]=1;
		for(i=2;i<101;i++){
			mo[i]=(a*mo[i-1]+b*mo[i-2])%7;
			for(j=1;j<i-1;j++){
				if(mo[j-1]==mo[i-1]&&mo[j]==mo[i]){
					t=i-j;
					break;
				}
			}
		}
		n=n%t;
		printf("%ld\n",mo[n-1]);
    }
        return 0;
}