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
#include<bits/stdc++.h>
using namespace std;
long long max(long long x,long long y)
{
return x>y?x:y;
}
int f[9999],a,b,i;
long long n;
int main()
{
f[1]=1,f[2]=1;
while(scanf("%d %d %lld",&a,&b,&n)==3)
{
if(a==0&&b==0&&n==0)break;
for(i=3;i<=50;i++)
{
f[i]=(a*f[i-1]+b*f[i-2])%7;
if(f[i]==1 && f[i-1]==1)break;
}
n=n%(i-2);
if(n==0)cout<<f[i-2]<<endl;
else
cout<<f[n]<<endl;
}
return 0;
}