Number Sequence 当f[i]==f[2]&&f[i-1]==f[1],周期=i-2



Number Sequence

Time Limit: 1000MS Memory limit: 65536K

题目描述

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).

输入

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.

输出

For each test case, print the value of f(n) on a single line.

示例输入

1 1 3
1 2 10
0 0 0

示例输出

2
5

#include<stdio.h>
int f[100000];
int main()
{
 int i,a,b,n;
 f[1]=1;f[2]=1;
 while(scanf("%d%d%d",&a,&b,&n)!=EOF&&a||b||n)
 {
  for(i=3;i<10000;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);
  printf("%d\n",f[n]);
 }
}