POJ 2402 Palindrome Numbers

题目链接

水题，LA我居然没找到在那里。

 #include <cstdio>
 #include <cstring>
 #include <string>
 #include <cmath>
 #include <ctime>
 #include <cstdlib>
 #include <iostream>
 using namespace std;
 #define LL long long
 LL dp[],bin[];
 int que[],s;
 void judge(int x)
 {
     s = ;
     while(x)
     {
         que[s++] = x%;
         x /= ;
     }
 }
 int main()
 {
     int i;
     LL temp,n,x;
     temp = ;
     bin[] = ;
     for(i = ;i <= ;i ++)
     bin[i] = *bin[i-];
     for(i = ;i <= ;i ++)
     {
         if(i% == )
         {
             dp[i] = temp*;
             temp *= ;
         }
         else
         {
             dp[i] = dp[i-];
         }
     }
     while(cin>>n&&n)
     {
         for(i = ;i <= ;i ++)
         {
             if(n > dp[i])
             n -= dp[i];
             else
             {
                 if(i == )
                 cout<<n<<endl;
                 else if(i == )
                 cout<<n<<n<<endl;
                 else if(i% == )
                 {
                     x = bin[i/] + n - ;
                     cout<<x;
                     judge(x);
                     for(i = ;i < s;i ++)
                     cout<<que[i];
                     cout<<endl;
                 }
                 else
                 {
                     x = bin[i/-] + n - ;
                     cout<<x;
                     judge(x);
                     for(i = ;i < s;i ++)
                     cout<<que[i];
                     cout<<endl;
                 }
                 break;
             }
         }
     }
     return ;
 }