codeforces #320 div 2A

有点快速幂的思想，

因为每次的繁殖都是成倍增加的，所以，我们从 n 一直除 2 除回去，期间会有余数的时候，这就是中间我们要往里加的那些

#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <algorithm>#include <cmath>#include <queue>#include <vector>#include <set>#include <stack>#include <map>#include <climits>using namespace std;typedef long long ll;const int maxn = 10000 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;ll n, a;int main() {    cin >> n;    ll t = n, ans = 0;    while(n) {        t = n;        n /= 2;        ans += (t - n*2);    }    cout << ans << endl;    return 0;}