uva 11121(-2进制)

报告参考：http://www.cnblogs.com/scau20110726/archive/2012/12/21/2828420.html

代码如下：

/**************************************************
 * Author     : xiaohao Z
 * Blog     : http://www.cnblogs.com/shu-xiaohao/
 * Last modified : 2014-03-27 23:04
 * Filename     : uva_11121.cpp
 * Description     : 
 * ************************************************/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#define MP(a, b) make_pair(a, b)
#define PB(a) push_back(a)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<unsigned int,unsigned int> puu;
typedef pair<int, double> pid;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;

const int INF = 0x3f3f3f3f;
const double eps = 1E-6;
const int LEN = 1001;
int kase = 1, f[LEN], t;

void solve(int n){
    t = 0;
    while(n){
        int tmp = n%(-2);
        f[t++] = abs(tmp);
        n/=(-2);
        if(tmp == -1) n++;
    }
}

int main()
{
//    freopen("in.txt", "r", stdin);

    int T, n;
    cin >> T;
    while(T--){
        cin >> n;
        cout << "Case #" << kase++ << ": ";
        solve(n);
        if(t == 0) cout << 0;
        for(int i=t-1; i>=0; i--) cout << f[i];
        cout << endl;
    }
    return 0;
}