HDU 1719 Friend 打表

#include
#include
#include
using namespace std;
vector v;
int main()
{
    v.push_back(1);v.push_back(2);
    for(int i=0;i1000) break;
        v.push_back((v[i]+1)*(v[i]+1)-1);
        int k=(int)v.size();
        for(int j=i+1;j::iterator new_end=(unique(v.begin(),v.end()));
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        vector::iterator it=lower_bound(v.begin(),new_end,n);
        if(*it!=n) cout<<"NO!"<