【HDU 1005 Number Sequence】+ 公式推导

Number Sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 158473 Accepted Submission(s): 38821

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 取模～～结果很少～很容易出现规律～～找到最小周期～～

AC代码 ：

#include<bits/stdc++.h>
typedef long long LL;
int pa[1010];
int main()
{
    LL a,b,n,m,i;
    pa[1] = pa[2] = 1;
    while(scanf("%lld %lld %lld",&a,&b,&n) != EOF && (a || b || n)){
        for(i = 3 ; i <= 1000 ; i++){
            pa[i] = (a * pa[i -1] + b * pa[i - 2]) % 7;
            if(pa[i] == 1 && pa[i - 1] == 1)
                break;
        }
        n = n % (i - 2);
        pa[0] = pa[i - 2]; // 把周期 1 ~ n 变成 0 ~ n - 1
        printf("%d\n",pa[n]);
    }
    return 0;
}