# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
222417 | dantoh000 | Popcount (COCI19_popcount) | C++14 | 6 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;
/*
int num = (n-1)/4;
for (int i = 1; i <= num; i++){
ans.push_back("A=(A>>4)+((A&1)+(A&2)+(A&3)+(A&4))<<"+tostring(n-i*4)+")");
}
if (n % 4 == 1){
ans.push_back("A=(A>>0)+(A&1)");
}
else if (n%4 == 2){
ans.push_back("A=(A>>1)+(A&1)+(A&2)");
}
else if (n%4 == 3){
ans.push_back("A=(A>>2)+(A&1)+(A&2)+(A&3)");
}
else if (n%4 == 0){
ans.push_back("A=(A>>3)+(A&1)+(A&2)+(A&3)+(A&4)");
}*/
for (int i = 0; i < n-1; i++){
ans.push_back("A=(A>>1)+((A&1)<<"+tostring(n-i-1)+")");
}
printf("%d\n",ans.size());
for (auto x : ans){
cout << x << endl;
}
}
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... |