Number Sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 86471 Accepted Submission(s): 20535
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).
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
Author
CHEN, Shunbao
Source
Recommend
JGShining
这个题目由于%7之后只有0,1, 2, 3, 4, 5, 6,所以必然是会有循环的,所以7*7=49,应该是49,但是为了确定,我干脆写了1000,反正到时候break就可以了嘛,还有就是我求出循环的那个i要-2,还有就是假如那个点%(循环节)之后所得的值如果恰好正好等于0,证明这就是循环节的最后一值了,比如循环之后的为1,1,0,1,2,3,4,5,1,1,0,1,2,那么循环节就是8,而n正好为8,所以n%8==0,让n=循环节就是了嘛!!!!!!!!!!
#include <iostream>
#include <cstring>
using namespace std;
int f[1000001];
int main()
{
int a,b,n;
while(cin>>a>>b>>n)
{
if(a==0&&b==0&&n==0)
break;
f[1]=1;
f[2]=1;
int xh=0;
int i;
for(i=3;i<=1001;i++)
{
f[i]=(a*f[i-1]+b*f[i-2])%7;
if(f[i]==1&&f[i-1]==1)
{
break;
}
}
xh=i-2;
n=n%xh;
if(n==0)n=xh;
cout<<f[n]<<endl;
}
return 0;
}