hdu1005 Number sequence(数学)

Number Sequence

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 116285    Accepted Submission(s): 28282

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
  
  
  
  


  
  
  
  


  
  
  
  

   
   
#include<stdio.h>
int main()
{
	int i,a,b;
	__int64 f[80],n;
	f[1]=f[2]=1;
	while(scanf("%d%d%I64d",&a,&b,&n)!=EOF&&a&&b&&n)
	{
		for(i=3;i<=50;i++)//因为循环周期是49，所以循环到50 就可以了，如果是for(i=3,i<=n;i++)回超时 
		{
			f[i]=(f[i-1]*a+f[i-2]*b)%7;
		} 
		__int64 m;
		m=n%49;
		printf("%I64d\n",f[m]);
	}
	return 0;
}
//因为是对7取余数，所以，f[m]的范围是0~6；
//循环周期是49，