From Evernote:

uva 11121

思考題

思考完變成另類的大數

[sourcecode language="cpp"]
//============================================================================
// Name : Base -2.cpp
// Date : 2013/3/15 下午2:08:14
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 1005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int bans[M];
int main() {
ios_base::sync_with_stdio(0);
int test;
scanf("%d",&test);
int ff=0;
while(test--){
int n;
Set(bans,0);

scanf("%d",&n);
int node;
if(n>0)node=1;
else n=-n,node=0;
int bsz=0;
if(n==0)printf("Case #%d: 0",++ff);
else printf("Case #%d: ",++ff);
for(;n!=0;){
bans[bsz++]=n%2;
n/=2;
}
int carry=0;
for(int i=0;i<bsz;i++){
int tmp=bans[i]+carry;
bans[i]=tmp%2;
carry=tmp/2;
if(((i&1)==node)&&bans[i]){
carry++;
}
}
if(carry){
if((bsz&1)==node){
bans[bsz++]=1;
bans[bsz++]=1;
}
else{
bans[bsz++]=1;
}
}
for(int i=bsz-1;i>=0;i--){
printf("%d",bans[i]);
}Pln();

}

}

[/sourcecode]