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[1010];
    while(~scanf("%lld",&n))
    {
        memset(s,0,sizeof(s));
        if (n==0)
        {
            puts("0");
            continue;
        }
        int flag = 0,i = 0;
        while(n)
        {
            s[i] = n%2;
            //printf("%lld
",s[i]);
            if (n < 0)
                s[i] = -s[i];
            n-=s[i];
            n/=-2;
            i++;
        }
        flag = i;
        reverse(s,s+i);
        for (i = 0; i < flag; i++)
        {
            printf("%lld",s[i]);
        }
        puts("");
    }
    return 0;
}