递推公式为f[i] = f[i-1] + f[i-2],斐波那契数列。
传送门:http://acm.hdu.edu.cn/showproblem.php?pid=1865
import java.io.*;
import java.math.*;
import java.util.*;
public class Main{
public static void main(String argv[]){
Scanner cin = new Scanner(System.in);
BigInteger [] f = new BigInteger[205];
f[1] = BigInteger.valueOf(1);
f[2] = BigInteger.valueOf(2);
for(int i = 3 ; i <= 200 ; i++) {
f[i] = f[i-1].add(f[i-2]);
}
int T;
T = cin.nextInt();
String s1;
s1 = cin.nextLine();
//为了读掉一个换行符
while(T > 0) {
T --;
s1 = cin.nextLine();
int len = s1.length();
System.out.println(f[len]);
}
}
}