#include <memory.h>
#include <iostream.h>
#include <math.h>
long n,t=0;
bool v1[100005],v2[100005];
int solve(long i)
{
        int j;
        for (j=0;j<=t;j++)
        {
                if (v1[j]==true)
                {
                        v2[j+i]=true;
                        v2[abs(j-i)]=true;
                }
        }
        if (v2[n]==true) {cout<<i<<endl; return 0;}
        t+=i;
        for (j=0;j<=t;j++) v1[j]=v2[j];
        memset(v2,false,sizeof(v2));
        solve(i+1);
        return 0;
}
int main(int argc, char* argv[])
{
  //      while(1)
    //    {
        cin>>n;
        memset(v1,false,sizeof(v1));
        memset(v2,false,sizeof(v2));
        v1[0]=true;
        solve(1);
      //  }
        return 0;
}
//---------------------------------------------------------------------------

• 深度问题. (931) uni 2005-08-31 14:37:17
  • exactly? (1) Lucifer 2005-09-01 02:35:42