打表:
#include <bits/stdc++.h>
using namespace std;
int a[101];
int main()
{
for(long long i = 4 ; i < 1000000000000; i++)
{
double p = 1.0 * 3 * i / 2.0;
int ans = sqrt(p * (p - i) * (p - i +1) * (p - i - 1));
if( ans * ans == p *(p - i) * (p - i +1) * (p - i - 1))
cout<<i<<endl;
}
return 0;
}
f[i] = 4 * f[i-1] - f[i-2];
package laal;
import java.math.BigInteger;
import java.util.*;
public class Main {
public static void main(String[] args) {
String s, L;
// BigInteger num = new BigInteger("1000000000000000000000000000000");
Scanner cin = new Scanner(System.in);
int t = cin.nextInt();
for (int i = 1; i <= t; i++) {
BigInteger c = BigInteger.valueOf(2);
BigInteger a = BigInteger.valueOf(4);
BigInteger now = BigInteger.valueOf(4);
BigInteger k = BigInteger.valueOf(4);
BigInteger x = cin.nextBigInteger();
while (now.compareTo(x) < 0) {
now = k.multiply(a).subtract(c);
c = a;
a = now;
}
System.out.println(now);
}
}
}