HDU1005 Number Sequence

Number Sequence

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 189224    Accepted Submission(s): 47244

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

思路：按照递归思路肯定超时或者超内存。数字对7取余后只可能出现0-6，按照式子，最多可能出现49种情况。找出循环体取余就好。

#include <stdio.h> 
int f[60];
int main()
{
    int A,B,n,i,j,flag,start,end;
    while(~scanf("%d%d%d",&A,&B,&n))
    {	 
		flag=0;f[1]=1;f[2]=1;
		if(A==0&&B==0&&n==0)
            break;
		for(i=3;i<=n&&!flag;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])	
				{
					flag=1;start=j;end=i;
					break;
				}
			}
		}
		if(flag)
		{
			printf("%d\n",f[start+(n-end)%(end-start)]);
		}
		else
			printf("%d\n",f[n]);
    }
    return 0;
}