HDOJ 1005

HDOJ 1005

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.

code

import java.util.Scanner;

public class Main {
    private static Scanner in;

    public static void main(String[] args) {
        in = new Scanner(System.in);
        while(in.hasNext()) {
            int a = in.nextInt();
            int b = in.nextInt();
            int c = in.nextInt();
            if(a == 0 && b == 0 && c == 0) {
                break;
            }
            int[] x = new int[50];
            x[1] = 1;
            x[2] = 1;
            for(int i = 3; i < 50; i++) {
                x[i] = (a * x[i-1] + b * x[i-2])%7;
            }
            System.out.println(x[c%49]);
        }
    }
}

tips

这题暴力方法过不了，看题目的式子最后有个%7，说明f（n）可能的值就是0-6这7种，所以f（n-1）+f（n-2）最多也只有7*7=49种情况，在A、B给定的情况下，也是49种情况，所以这个f（n）是个循环数组。