uva11645 Bits（数位统计）

#include <stdio.h>
#include <string.h>
#include <set>
#include <map>
#include <algorithm>
#include<vector>
#include<complex>
#include<iostream>
#define ll long long
const ll rad=10000;
using namespace std ;

struct bint{
ll v[100],l;
bint(){
l=1;v[1]=0;
}
};

inline bint operator+(bint a,bint b){
if(a.l<b.l) swap(a,b);
ll t=b.l;
for(ll i=1;i<=t;i++) a.v[i]+=b.v[i];
for(ll i=1;i<=t;i++){
if(a.v[i]>=rad){
if(i==a.l) a.v[i+1]=0,a.l++;//***
a.v[i+1]+=(a.v[i]/rad);
t=max(t,i+1);
a.v[i]%=rad;
}
}
return a;
}

inline bint operator+(bint a,ll p){
bint b;
b.v[1]=p,b.l=1;
return a+b;
}

int cas;
ll n;
ll last,now,l,r,base;

void print(bint a){
printf("%lld",a.v[a.l]);
for(ll i=a.l-1;i>=1;i--) printf("%04lld",a.v[i]);
printf("\n");
}
bint ans;

int main(){
cas=0;
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
while(scanf("%lld",&n)!=EOF){
if(n<0) break;
ans.v[1]=0,ans.l=1;
last=0,now=0;
r=0,l=n,base=1;
last=l%2; l>>=1;
while(l){
now=l%2;
l>>=1;
if(now==1&&last==1){
ans=((ans+l*base)+(r+1));
}
else{
ans=(ans+(l*base));
}
r=r+last*base;
base<<=1;
last=now;
}
printf("Case %d: ",++cas);
print(ans);
}
return 0;
}