Number Sequence

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

当出现两个1 1的时就是循环节出现的地方，但由于不知道循环节出现的大概位置
我将数组开的很大，结果一直segment wrong ，但后来发现这不是数组的原因
而是只能计算到第49个数据，一旦超过这个范围就会报segment wrong

 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
int sum[1000000];
int main()
{
    int a,b,n;
    sum[1]=1;sum[2]=1;
    while(cin>>a>>b>>n)
    {
        if(a+b+n==0)break;
        int i;
        for(i=3;i<50;i++)
        {
            sum[i]=(a*sum[i-1]+b*sum[i-2])%7;
            if(sum[i-1]==1&&sum[i]==1)break;
        }
        int xun=i-2;
        if(n%xun==0)printf("%d\n",sum[xun]);
        else printf("%d\n",sum[n%xun]);
    }
}