POJ 1702

 #include <iostream>
 #include <cmath>
 #define MAXN 100
 using namespace std;

 void fun(int num);
 void fun_1();

 int ans[MAXN];

 struct node
 {
     int ans[MAXN];
     int len;
     node()
     {
         memset(ans,,sizeof(ans));
         len = ;
     }
 };

 node _l;
 node _r;

 int main()
 {
     //freopen("acm.acm","r",stdin);
     int test;
     int i;
     int num;

     cin>>test;
     while(test --)
     {
         memset(_r.ans,,sizeof(_r.ans));
         memset(_l.ans,,sizeof(_l.ans));
         cin>>num;
         fun(num);
         fun_1();
         bool boo;
         int tem = ;
         boo = false;
     //    int p = -1;
     //    bool ok = false;
         int index = ;
         for(i = ; i < MAXN; ++ i)
         {
             if(_l.ans[i] != )
             {
                 ans[index ++]  = pow((double),tem);
                 boo = true;
             }

             ++ tem;
         }
         if(boo)
         {
             for(i = ; i < index-; ++ i)
             {
                 cout<<ans[i]<<",";
             }
             cout<<ans[index-]<<" ";
         }
         else
         {
             cout<<"empty ";
         }

         index = ;
         boo = false;
         tem = ;
         for(i = ; i < MAXN; ++ i)
         {
             if(_r.ans[i] != )
             {
                 ans[index ++]  = pow((double),tem);
                 boo = true;
             }

             ++ tem;
         }
         if(boo)
         {
             for(i = ; i < index-; ++ i)
             {
                 cout<<ans[i]<<",";
             }
             cout<<ans[index-];
         }
         cout<<endl;
     }
 }

 void fun(int num)
 {
     int i;
     int tem;
     i = ;
     while(num)
     {
         _r.ans[i ++] = num%;
         num /= ;
     }
     _r.len = i;
 }

 void fun_1()
 {
     int i;
     int c = ;
     for(i = ; i < MAXN; ++ i)
     {
         _r.ans[i] += c;
         if(_r.ans[i] == )
         {
             _r.ans[i] = ;
         //    _r.ans[i+1] += 1;
             c = ;
             _l.ans[i] += ;
         }
         else if(_r.ans[i] == )
         {
             _r.ans[i] = ;
         // _r.ans[i+1] += 1;
             c = ;
         }
         else
         {
             c = ;
         }

     }
 }

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。

技术网站地址： vmfor.com