Submission #222539

#TimeUsernameProblemLanguageResultExecution timeMemory
222539lycPopcount (COCI19_popcount)C++14
30 / 110
5 ms384 KiB
#include <bits/stdc++.h> using namespace std; #define SZ(x) (int)(x).size() #define FOR(i,a,b) for(int i=(a);i<=(b);++i) #define RFOR(i,a,b) for (int i=(a);i>=(b);--i) int f(int A, int N) { cout << ((1<<N)-1) << " " << (1<<1) << " :: " << (A&((1<<N)-(1<<1))) << " " << ((A>>1)&1) << endl; return ((A&(((1<<N)-1)-(1<<1)))+((A>>1)&1)); } int main() { ios::sync_with_stdio(false); cin.tie(0); int N, K; cin >> N >> K; vector<string> ans; for (int i = 1; i <= N-1; i += 4) { string cur = "A=", ms = ""; vector<string> mask; vector<string> stk; for (int j = 0; j < 4 && i+j <= N-1; ++j) { mask.push_back("((0-1)-(1<<" + to_string(i+j) + "))"); stk.push_back("((A>>" + to_string(i+j) + ")&1)"); } FOR(i,0,SZ(mask)-1) ms += "("; ms += "A"; FOR(i,0,SZ(mask)-1) ms += "&" + mask[i] + ")"; FOR(i,0,SZ(stk)-1) cur += "("; cur += ms; FOR(i,0,SZ(stk)-1) cur += "+" + stk[i] + ")"; assert(SZ(cur) <= 1000); ans.push_back(cur); } cout << SZ(ans) << '\n'; for (auto& s : ans) cout << s << '\n'; //FOR(i,0,7) cout << f(i,3) << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...