先打个表,找出10000000以内所有的t满足 Triangle。
得到递推式dp[n]=4*dp[n-1]-dp[n-2]
import java.util.Scanner;
import java.math.BigInteger;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
for(int i=1;i<=t;++i)
{
BigInteger a = sc.nextBigInteger();
BigInteger b = new BigInteger("2");
BigInteger c = new BigInteger("4");
BigInteger d;
BigInteger k = new BigInteger("4");
while(c.compareTo(a)<0)
{
d=k.multiply(c).subtract(b);
b=c;
c=d;
//System.out.println(b);
}
System.out.println(c);
}
}
}