hdu 1005 Number Sequence

川长思鸟来 2022-06-17 13:17 274阅读 0赞

Number Sequence

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 170620 Accepted Submission(s): 42098

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

Sample Input

  1. 1 1 3
  2. 1 2 10
  3. 0 0 0

Sample Output

  1. 2
  2. 5
  13.     #include<cstdio>
  14. int ans[49];
  15. int main()
  16. {
  17.     int A,B,n,i;
  18.     while(~scanf("%d%d%d",&A,&B,&n))
  19.     {
  20.         if(A==0&&B==0&&n==0)
  21.             printf("");
  22.         else
  23.         {
  24.             ans[0]=0;
  25.             ans[1]=1;
  26.             ans[2]=1;
  27.             for(i=3; i<=48; i++)
  28.                 ans[i]=(A*ans[i-1]+B*ans[i-2])%7;
  30.             printf("%d\n",ans[n%48]);
  31.         }
  32.     }
  33.     return 0;
  34. }

发表评论

表情：
评论列表 （有 0 条评论，274人围观）

还没有评论，来说两句吧...

相关阅读