打表水一发
#include <iostream> #include<string> #include<cstring> #include<algorithm> using namespace std; typedef long long ll; int n,m; long long a[15000]={0,1,2}; int main() { int flag=2; for(int i=3;i<15000;i++) a[i]=a[i-1]+flag++; cin>>n; while(n--) { cin>>m; int len=lower_bound(a,a+15000,m)-a; if(a[len]==m)cout<<1<<endl; else cout<<0<<endl; } return 0; }