HDOJ1005 Number Sequence

Number Sequence

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

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

 

Source

CHEN, Shunbao

 

Recommend

JGShining

 

/**/ /*
  Name: HDOJ1005
  Copyright: 
  Author: Tad
  Date: 26-07-07 16:03
  Description: 
*/

#include < iostream >
using   namespace  std;
int  main()
... {
int a,b,n;
while(cin>>a>>b>>n)
...{
  if(a==0&&b==0&&n==0)
  break;
  int circle[50]=...{1,1};
  int i;
  for(i=2;i<50;i++)
  ...{
  circle[i]=(circle[i-1]*a+circle[i-2]*b)%7;
  if(circle[i]==1&&circle[i-1]==1)
    break;
  }

  n=n%(i-1);
  if(n==0)
  cout<<circle[i-2]<<endl;
  else
  cout<<circle[n-1]<<endl;
}
}

 

Download the code

http://dl2.csdn.net/down4/20070726/26160435203.cpp