跟据x^3-y^3=(x-y)(x^2+x*y+y^2)得出,再根据x-y=1得出x^3-y^3=3*y^2+3*y+1这个答案
附上代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=1e6+5;
ll tab[maxn];
void make_table()
{
for(ll i=0;i<maxn;i++){
tab[i]=3*i*i+3*i+1;
}
}
int main()
{
make_table();
int t;
scanf("%d",&t);
while(t--){
ll p;
scanf("%lld",&p);
ll res=*lower_bound(tab,tab+maxn,p);
if(*lower_bound(tab,tab+maxn,p)==p){
printf("YES\n");
}else{
printf("NO\n");
}
}
return 0;
}