统计二进制数中的1的个数(0277)

#include<iostream>
#include<math.h>
using namespace std;
int max(int a, int b)
{
    return a > b ? a : b;
}
int min(int a, int b)
{
    return a < b ? a : b;
}
int main()
{
    int i, j, k=0,t,s;
    int N;
    cin >> N;
    while (N != 0)
    {
        t = N % 2;
        if (t == 1)
        {
            k = k + 1;
        }
        N = N / 2;
    }
    cout << k << endl;

    
    return 0;
}