The Moronic Cowmpouter(负进位制转换)

http://poj.org/problem?id=3191

题意：将一个整型的十进制整数转化为-2进制整数。

 #include <stdio.h>
 #include <algorithm>
 #include <stdlib.h>
 #include <string.h>
 #define LL long long
 using namespace std;
 int main()
 {
     LL n,s[];
     while(~scanf("%lld",&n))
     {
         memset(s,,sizeof(s));
         if (n==)
         {
             puts("");
             continue;
         }
         int flag = ,i = ;
         while(n)
         {
             s[i] = n%;
             //printf("%lld\n",s[i]);
             if (n < )
                 s[i] = -s[i];
             n-=s[i];
             n/=-;
             i++;
         }
         flag = i;
         reverse(s,s+i);
         for (i = ; i < flag; i++)
         {
             printf("%lld",s[i]);
         }
         puts("");
     }
     return ;
 }