Submission #517317

#TimeUsernameProblemLanguageResultExecution timeMemory
517317KoDPopcount (COCI19_popcount)Cpython 3
75 / 110
16 ms2844 KiB
n, m = map(int, input().split()) k = 1 ans=[] while k < n: s = '' while len(s) < n: s += '1' * k s += '0' * k b = int((s[:n])[::-1], 2) ans.append('A=((A&{})+((A>>{})&{}))'.format(b, k, b)) k *= 2 print(len(ans)) print(*ans,sep='\n')
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...