递推

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstdlib>
#include<vector>
#include<stack>
#include<deque>
using namespace std;
int main()
{ 
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int s;
		cin>>s;
		if(s>10000000)
		{
			for(int j=1000406,y=1415;j<=s;j+=y,y++)
			{
				if(j==s)
				{
					s=0;
					break;
				}
			}
		}
		else
		{
			for(int j=1,y=1;j<=s;j+=y,y++)
			{
				if(j==s)
				{
					s=0;
					break;
				}
			}
		}
		if(s==0) cout<<"1"<<endl;
		else cout<<"0"<<endl;
	}
	return 0;
}

这是数学

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<stack>
#include<deque>
#include<map>
using namespace std;
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int s;
		cin>>s;
		for(int j=1;s-j>0;j++) s-=j;
		if(s==1) cout<<"1"<<endl;
		else cout<<"0"<<endl;
	}
	return 0;
}