Dailycode_6.5(整数二进制数中1的个数，手套）

#include <iostream>

using namespace std;

int main()
{
    int N = 0;
    while(cin >> N)
    {
        int count = 0;
        while(N)
        {
        	//是1就总数加一
            if (N & 1 == 1)
                count++;
            N >>= 1;
        }
        cout << count << endl;
    }
}

class Gloves {
public:
    int min(int a, int b)
    {
        if (a > b)
            return b;
        return a;
    }
    int findMinimum(int n, vector<int> left, vector<int> right) {
        // write code here
        int sum = 0;
        int lsum = 0;
        int rsum = 0;
        
        int lmin = 26;
        int rmin = 26;
        for (int i = 0; i < n; ++i)
        {
            if (left[i] * right[i] == 0)
                sum = left[i] + right[i] + sum;
            else
            {
                lsum += left[i];
                rsum += right[i];
                
                lmin = min(lmin, left[i]);
                rmin = min(rmin, right[i]);
            }
            
        }
        return (sum + min(lsum - lmin +1, rsum - rmin + 1) + 1);
    }
};