LightOJ 1352 Strange Summation(找规律or数位DP)

:

[code]#include<cstdio>
#include<cstring>

using namespace std;
typedef unsigned long long LL;

LL num[70];
int top;

void sol(LL n,int p){
//printf("-> %llu %d\n",n,p);
LL m,j,cnt;
int i;
num[0] += p*n;
for(i = 1;i < 63;i++){
m = 1LL<<i;j = 1;
if(m > n) break;
while(2*m <= n){
num[i] += p*m/2;
m *= 2;
j *= 2;
}
m = n-m+1;
//printf("m:%llu j:%llu\n",m,j);
num[i] += p*j*(m/j/2);
if((m/j)&1) num[i] += p*(m%j);
//printf("i:%d numi:%llu\n",i,num[i]);
}
}

int main(){
int i,j,cas;
LL l,r;
scanf("%d",&cas);
for(int T=1;T<=cas;T++){
scanf("%llu%llu",&l,&r);
memset(num,0,sizeof(num));
sol(r,1);
sol(l-1,-1);
for(top = 0;r;r>>=1,top++);
LL ans = 0;
for(i = top-1;i >= 0;i--){
//printf("%d %llu\n",i,num[i]);
ans += (num[i]&1LL)<<(top-1-i);
/*for(j = 1;j <= i;j++){
num[i-j] += (num[i]>>j&1);
}*/
}
printf("Case %d: %llu\n",T,ans);
}

return 0;
}