CDOJ 方老师开橙卡

 bfs好像不太容易AC，尝试了下dfs。

#include<stdio.h>
#include<string.h>
#include<math.h>
typedef long long LL;
#define INF 1000000000000000000
LL X(int i)
{
     LL an=1;
    for(int t=1;t<=i;t++)
       an*=10;
    return an;
}
LL n,ans;
void   dfs(LL now,int index)
{
    int i;
    LL tmp;
   // printf("%d  %lld  %d\n",n%X(index-1)==n,now,index);
    if(n%X(index-1)==n&&(now*now)%X(index-1)==n)  {ans=ans>now?now:ans; return ; }
    for(i=0;i<=9;i++)
    {
           tmp=now+i*X(index-1);
        if((tmp*tmp)%X(index)==n%X(index))
             { dfs(tmp,index+1); }
    }
}

int main()
{
     int T;
     scanf("%d",&T);
     while(T--)
     {
          scanf("%lld",&n);
          ans=INF;
          dfs(0,1);
          if(ans==INF)
            printf("None\n");
         else
            printf("%lld\n",ans);
     }
    return 0;
}