hdoj 1005
首先看到这个题,想到的就是递归调用,但是注意这里有个技巧f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7:
由于是mod7,所以f(n)取值为0~6,同理f(n-1)和f(n-2)也是0~6共7种情况,那么在A、B一定的情况下A*f(n-1)+B*f(n-2)一共有7*7种情况。
一、递归调用(逻辑简单,内存开销较大):
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
int a = sc.nextInt();
int b = sc.nextInt();
int n = sc.nextInt();
if (a == 0 && b == 0 && n == 0) {
break;
}
if (n > 49) {
n %= 49;
}
System.out.println(f(a, b, n));
}
}
public static int f(int a, int b, int n) {
if (n == 1 || n == 2) {
return 1;
} else {
return (a * f(a, b, n - 1) + b * f(a, b, n - 2)) % 7;
}
}
}
二、用数组把用到的情况都存起来,注意这里没有算出所有49种情况,而是只计算了n种;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
int a = sc.nextInt();
int b = sc.nextInt();
int n = sc.nextInt();
if (a == 0 && b == 0 && n == 0) {
break;
}
if (n > 49) {
n %= 49;
}
int[] arr = new int[49];
arr[0] = 1;
arr[1] = 1;
for (int i = 2; i < n; i++) {
arr[i] = (a * arr[i - 1] + b * arr[i - 2]) % 7;
}
System.out.println(arr[n - 1]);
}
}
}