ACdream 1154 Lowbit Sum （数位dp）

/*
* this code is made by LzyRapx
* Problem: 1154
* Verdict: Accepted
* Submission Date: 2017-06-21 23:56:51
* Time: 180MS
* Memory: 1664KB
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int lowbit(int x)
{
return x&(-x);
}
ll DP(int x)
{
if(x==1)return 1;
return 2*DP(x>>1) + (x>>1) + (x&1);
}
int main()
{
int n =0 ;
/*
for(int n=1;n<=10;n++){
int  ans  = 0 ;
for(int i=1;i<=n;i++){
ans+=lowbit(i);
cout<<lowbit(i)<<" ";
}
cout<<endl;
cout<<ans<<endl;
}   */
while(~scanf("%d",&n))
{
cout<<DP(n)<<endl;
}
return 0;
}