#include<bits/stdc++.h>usingnamespace std;#define ll long longconstint maxn =1e5+7;
ll t,n;
ll lowbit(ll x){return(-x)& x;}intmain(){int t ;scanf("%lld",&t);while(t--){scanf("%lld",&n);int cnt =0;if(n <0) n +=(1LL<<32);//cout << n << endl;for(ll i = n ; i >0; i -=lowbit(i)) cnt ++;
cout << cnt << endl;}return0;}
#include<iostream>#include<cstring>#include<cstdio>#include<queue>#include<cstdlib>#include<cmath>#include<stack>#include<map>#include<string>#include<vector>#include<algorithm>usingnamespace std;#define ll long long#define INF 0x3f3f3f3f#define ull unsigned long long#define endl '\n'constdouble pi =acos(-1);constint maxn =1e6+10;constint maxm =2e7+10;const ll mod =998244353;int t, tt, n, m, op;struct node{int x;int y;}a[maxn], b[maxn];boolcmp(node aa, node bb){return aa.x < bb.x;}intmain(){scanf("%d",&n);for(int i =1; i <= n ;++ i){scanf("%d %d",&op,&m);if(op ==0) a[++t].x = m, a[t].y=i;if(op ==1) b[++tt].x = m, b[tt].y=i;}sort(a +1, a +1+ t, cmp);for(int i =1; i <= tt ;++ i){int l =1, r = t;while(l <= r){int mid =(l + r)>>1;if(a[mid].x==b[i].x){
l = mid;break;}elseif(a[mid].x < b[i].x) l = mid +1;else r = mid -1;}int p = l;if(a[p].x==b[i].x&&a[p].y<b[i].y) cout <<"yes"<<endl;else cout <<"no"<<endl;}return0;}
#include<iostream>#include<cstring>#include<cstdio>#include<queue>#include<cstdlib>#include<cmath>#include<stack>#include<map>#include<string>#include<vector>#include<algorithm>usingnamespace std;#define ll long long#define INF 0x3f3f3f3f#define ull unsigned long long#define endl '\n'constdouble pi =acos(-1);constint maxn =1e5+10;constint maxm =2e7+10;const ll mod =998244353;int n, flag;char s[maxn];intmain(){scanf("%d",&n);scanf("%s", s);int len =strlen(s);for(int i =1; i < len ;++ i){if(s[i]==s[i-1]){
flag =1;break;}}for(int i =1; i < len -1;++ i){if(s[i+1]==s[i-1]){
flag =1;break;}}if(flag) cout <<"YES";else cout <<"NO";return0;}
#include<iostream>#include<cstring>#include<cstdio>#include<queue>#include<cstdlib>#include<cmath>#include<stack>#include<map>#include<string>#include<vector>#include<algorithm>usingnamespace std;#define ll long long#define INF 0x3f3f3f3f#define ull unsigned long long#define endl '\n'constdouble pi =acos(-1);constint maxn =2e5+10;constint maxm =2e7+10;const ll mod =998244353;int n, m;
ll a[maxn], m1, m2, p[maxn];struct node{
ll sum, id;}s[maxn];boolcmp(node a, node b){return a.sum == b.sum ? a.id < b.id : a.sum < b.sum;}intmain(){scanf("%d %d",&n,&m);for(int i =1; i <= n ;++ i){scanf("%d",&a[i]);
s[i].sum =(s[i-1].sum + a[i])% m;
p[i]= p[i-1]+a[i];
s[i].id = i;}//for(int i = 1 ; i <= n ; ++ i) cout << s[i].sss << ' ';//cout << endl;sort(s +1, s +1+ n, cmp);int t =0;for(int i =0; i <= n ;++ i){if(s[i].sum!=s[t].sum){int r = s[i-1].id, l = s[t].id;//cout << l << ' ' << r << endl;
m1 =max(p[r]-p[l], m1);//cout << s[r].sss-s[l].sss << endl;
m2 =max(m2,(ll)(r-l));
t = i;}}//cout << t << endl;//cout << s[t-1].sss << ' ' << s[n].sss << endl;int r = s[n].id, l = s[t].id;
m1 =max(p[r]-p[l], m1);
m2 =max(m2,(ll)(r-l));
cout << m1 <<' '<< m2;return0;}