[暖手][学习阶段-各路杂题][HDU-1005]Number Sequence

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
  
  

 

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		
		int a = in.nextInt();
		int b = in.nextInt();
		int n = in.nextInt();
		while(a!=0&&b!=0&&n!=0){
			int[] num = new int[51];
			num[1]=num[2]=1;
			int i;
			for(i=3;i<51;i++){
				num[i]=(a*num[i-1]+b*num[i-2])%7;
				if(num[i]==1&&num[i-1]==1)
					break;
			}
			int key=i-2;
			num[0]=num[key];
			System.out.println(num[n%key]);
			a = in.nextInt();
			b = in.nextInt();
			n = in.nextInt();
		}
		}
	}