杭电ACM OJ 1005 Number Sequence 简单却重要的公式题 完美考察了递归思想

Number Sequence

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

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 1 3，其中 1是A， 第二个1是B， 3是N，就是要求你计算这个公式的第几个结果
   
   


   
   

   
   
public class NumberSequence1005 {
    //f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.
    //1,1,3
    //1,2,10
    private static int A;
    private static int B;
    private static int N;

    public static void main(final String[] args) throws Exception {

        initData();

        int result = calculate(N);

        System.out.println(result + "");
    }

    private static void initData() {
        A = 1;
        B = 1;
        N = 3;
//        A = 1;
//        B = 2;
//        N = 10;
    }

    private static int calculate(int N) {
        int result = 0;
        if (N == 2 || N ==1) {
            return 1;
        }
        result = (A * calculate(N - 1) + B * calculate(N -2)) % 7;
        return result;
    }
}