# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
222441 | dantoh000 | Popcount (COCI19_popcount) | C++14 | 5 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
string tostring(int x){
string s;
if (x == 0) return "0";
while (x){
s += (x%10)+'0';
x /= 10;
}
reverse(s.begin(),s.end());
return s;
}
int main(){
int n,k;
scanf("%d%d",&n,&k);
vector<string> ans;
//srand(time(NULL));
//int T = rand()%(1<<n);
//int ch = __builtin_popcount(T);
int num = n/4;
for (int i = 1; i <= num; i++){
//printf("T = %d\n",T);
//printf("add %d shift %d\n",(T&1)+((T&2)>>1)+((T&4)>>2)+((T&8)>>3),(n-i*4-1));
ans.push_back("A=(A>>4)+(((A&1)+((A&2)>>1)+((A&4)>>2)+((A&8)>>3))<<"+tostring(n-i*4-1)+")");
//T =(T>>4)+(((T&1)+((T&2)>>1)+((T&4)>>2)+((T&8)>>3))<<(n-i*4-1));
}
n %= 4;
//printf("there are %d bits left\n",n);
if (n == 2){
ans.push_back("A=(A>>1)+(A&1)");
//T=(T>>1)+(T&1);
}
else if (n == 3){
ans.push_back("A=(A>>2)+(A&1)+((A&2)>>1)");
//T=(T>>2)+(T&1)+((T&2)>>1);
}
/*else if (n%4 == 2){
ans.push_back("A=(A>>3)+(A&1)+((A&2)>>1)+((A&4)>>2)");
T=(T>>3)+(T&1)+(T&2)+(T&4);
}
else if (n%4 == 3){
ans.push_back("A=(A>>4)+(A&1)+((A&2)>>1)+((A&4)>>2)+((A&8)>>3)");
T=(T>>4)+(T&1)+(T&2)+(T&4)+(T&8);
}*/
printf("%d\n",ans.size());
for (auto x : ans){
cout << x << "\n";
}
//printf("%d %d\n",T,ch);
//assert(T==ch);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |