Submission #711735

#TimeUsernameProblemLanguageResultExecution timeMemory
711735pccPopcount (COCI19_popcount)C++14
0 / 110
1 ms212 KiB
#include <bits/stdc++.h> using namespace std; int main(){ // ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); int n,k; cin>>n>>k; cout<<"1\nA=((((1<<3)>>3)+(1<<2))+(1<<2))";return 0; cout<<(n+3)/4<<'\n'; for(int i = 0;i<n;i+=4){ printf("A=((((((A&(1<<%d))>>%d)+((A&(1<<(%d)))>>(%d)))+((A&(1<<(%d)))>>(%d)))+((A&(1<<(%d)))>>(%d)))+((A>>(%d))<<(%d)))\n",i,i,i+1,i+1,i+2,i+2,i+3,i+3,i+4,i+4); // cout<<"A=(((A&(1<<"<<i<<"))>>"<<i<<")+(A-(A&"<<"(1<<"<<i<<"))))\n"; // A=(((A&(1<<0))>>0)+(A-(A&(1<<0)))) // A=((((((A&(1<<0))>>0)+((A&(1<<(0+1)))>>(0+1)))+((A&(1<<(0+2)))>>(0+2)))+((A&(1<<(0+3)))>>(0+3)))+((A>>(0+4))<<(0+4))) } // for(int j = 0;j<(1<<n);j++){ // int A = j; // for(int i = 1;i<n;i++){ // A=((A&(1<<i))>>i)+(A^(A&(1<<i))); // } // assert(A == __builtin_popcount(j)); // } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...