注解
1、必须用Java大数。
2、找规律,找递推关系。因为要得到00,必须有01;要得到01,必须有1或者00。因此,假设00的个数为a[n],01的个数为b[n],1的个数为c[n],则:
a[n] = b[n-1]
b[n] = c[n-1] + b[n-1],
所以a[n] = c[n-2] + a[n-2],而c[n]=2的n-1次方(即2^(n-1)),因此a[n]=2的n-3次方+a[n-2]
代码
import java.math.BigInteger;
import java.util.Scanner;
class Num{
BigInteger id;
BigInteger sum;
}
public class Main {
public static void initiate(Num[] num) {
for(int i=0; i<1001; i++) {
num[i] = new Num();
}
num[0].sum = BigInteger.ZERO;
num[1].sum = BigInteger.ZERO;
num[2].sum = BigInteger.ONE;
num[3].sum = BigInteger.ONE;
num[3].id = BigInteger.ONE;
for(int i=4; i<1001; i++) {
num[i].id = num[i-1].id.multiply(new BigInteger("2"));
num[i].sum = num[i].id.add(num[i-2].sum);
}
}
public static void main(String[] args) {
Num[] num = new Num[1001];
initiate(num);
Scanner sc = new Scanner(System.in);
while(sc.hasNext()) {
int n = sc.nextInt();
System.out.println(num[n].sum);
}
sc.close();
}
}