hdu1005Number Sequence

        这道题是有循环周期的，49一循环。

Number Sequence

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

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
  
  
  
  

   
   ac代码：
  
  
  
  

   
   
#include<cstdio>
int main()
{
    int str[50];
    int a,b,n,i;
    while(~scanf("%d%d%d",&a,&b,&n),!(a==0&&b==0&&n==0))
    {
        str[1]=str[2]=1;
        for(i=3;i<=49;i++)
        {
           str[i]=(a*str[i-1]+b*str[i-2])%7;
        }
        printf("%d\n",str[n%49]);
    }
    return 0;
}
/*    49一循环*/