Uva-10276-Hanoi Tower Troubles Again!

本来好像是二分图的题，结果直接模拟就过了~囧~

代码：

#include<cstdio>#include<cstring>#include<iostream>#include<cmath>using namespace std;int num[51];int main(){    int T,n;    scanf("%d",&T);    while(T--)    {memset(num,0,sizeof(num));int st=0,ed=0,ans=1;scanf("%d",&n);for(;;ans++){    bool flag=0;    for(int i=st;i<ed;i++)    {double ita=sqrt(num[i]+ans);if((int)ita==ita){    flag=1;    num[i]=ans;    break;}    }    if(!flag)num[ed++]=ans;    if(ed>n)break;}printf("%d\n",ans-1);    }    return 0;}