大二第一次周赛 第四题

Problem D

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 102   Accepted Submission(s) : 33

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

 

 1 #include<stdio.h>
 2 int a[10000];
 3 int main()
 4 {
 5     int a,b,n,i;
 6     while(scanf("%d %d %d",&a,&b,&n)&&(a!=0||b!=0||n!=0))
 7         {
 8         int f[10000];
 9         f[1]=f[2]=1;
10         for(i=3;i<100;i++)
11             {
12             f[i]=(a*f[i-1]+b*f[i-2])%7;
13             if(f[i-1]==1&&f[i]==1)
14             break;
15             }
16         n=n%(i-2);
17         f[0]=f[i-2];
18         printf("%d\n",f[n]);
19        }
20      return 0;
21 }

 

转载于:https://www.cnblogs.com/hpuzyf/p/3366562.html