1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
#include<cmath>
#include<deque>
#include<functional>
#include<iterator>
#include<set>
#include<utility>
#include<stack>
#include<queue>
#include<bitset>
#define maxn 101
#define inf 1500000007
using namespace std;
typedef long long LL;
int dig[maxn];
int main()
{
    int n;//11011
    while(~scanf("%d",&n)){
        int len = 0,sum = 0;
        int flag = -1;
        while(n){
            dig[++len] = n % 2 ;
            if(dig[len] == 1){
                sum++;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX