连续的比特 (Bits,UVa 11645)

#include <iostream>
#include <string.h>
#include <string>
#include <fstream>
#include <algorithm>
#include <stdio.h>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
using namespace std;
const double eps = 1e-8;
const double pi=acos(-1.0);
const int INF=0x7fffffff;
unsigned long long uINF = ~0LL;
#define MAXN 10000007
typedef long long LL;
LL a,b;
void Plus(LL x)
{
    b+=x;//cout<<x<<endl;
    if(b>=(1000000000000ll))
    {a+=b/(1000000000000ll);
    b%=(1000000000000ll);}
}
int main()
{
    LL n,t=1;
    while(scanf("%lld",&n),n!=-1)
    {
        a=b=0;
        LL temp=n;
        LL dig=1;
        while(n>1)
        {
            Plus((n>>2)*dig);
            if((n&3)==3)
                Plus((temp&(dig-1))+1);
            dig<<=1;
            n>>=1;
        }
        printf("Case %d: ",t++);
        if(a)
        {
            printf("%lld",a);
            printf("%012lld
",b);
        }
        else printf("%lld
",b);
    }

    return 0;
}

和 UVa 11038 类似 按位计算