题目
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
Output
2
5
题目译文
数列定义如下:f(1) = 1, f(2) = 1, f(n) = (A* f(n - 1) + B * f(n - 2)) mod 7。
给定A, B和n,计算f(n)的值。
输入由多个测试用例组成。
每个测试用例在一行中包含3个整数A、B和n (1 <=A,B <= 1000, 1 <= n <= 100,000,000)。
三个零表示输入结束,此测试用例不进行处理。
输出对于每个测试用例,在一行上打印f(n)的值。
思路
本题用递归空间超限,用递推时间超限,因此需要找到规律。
对于任意1个整数n,mod7的结果均在0~6之间,共7个值,因为题目有A、B两个参数,由排列组合可得,共7×7=49种排列方式,即f(n)%7每49一循环。故只需算1<=n<=49的f(n)的值,求f(n%49)的值。
代码
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int ac[52];
int main(){
int a,b,i;
ll n;
while(1){
cin>>a>>b>>n;
if(a==0&&b==0&&n==0)
break;
ac[1]=1;
ac[2]=1;
for(i=3;i<=49;++i)
ac[i]=(a*ac[i-1]+b*ac[i-2])%7;
cout<<ac[n%49]<<endl;
}
return 0;
}