Home Archives Categories Tags Docs

1005 Number Sequence

发布时间: 更新时间: 总字数:174 阅读时间:1m 作者: 分享

1005 Number Sequence

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

代码

本题的重点是寻找数据的规律性:

#includeusing namespace std;

int main()
{
       int a, b, n, i
       int f[49];
       f[1]=1;
       f[2]=1;
       while(cin>>a>>b>>n)
       {
              if(a==0 && b==0 && n==0)
                     break;
              for(i=3; i<49; i++)
                     f[i]=(a*f[i-1]+b*f[i-2])%7;
              f[0]=f[48];
              cout<<f[nH]<<endl;
       }
       return 0;
}

参考

相关文章
最近更新
最新评论
加载中...