cqm解题报告02

#include<stdio.h>
#include<iostream>
using namespace std;
int n;
int main()
{
int t;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
int res = 0;
for (int i = 0,j=1; i < 32; i++)
{
if ( n & j )
res ++ ;
j<<=1;
}
printf("%d\n",res);
}
return 0;
}

#include<cstdio>
#include<cstdlib>
#include<cctype>
#include<cstring>
#include<cmath>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
const int M =1e6+5,INF=0x3f3f3f3f;
int main(){
int T;
scanf("%d",&T);
while(T--){
int n;
scanf("%d",&n);
printf("%d\n",__builtin_popcount(n));
}
return 0;
}