| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 222517 | dwsc | Popcount (COCI19_popcount) | C++14 | 0 ms | 0 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.
n,k= input().split(" ")
n = int(n)
k = int(k)
print(n,k)
numboxes = n
boxsize = 1
val =0
tempn = n
while (tempn != 1):
val+= 1
tempn = (tempn+1)//2
print(val)
while numboxes != 1:
bigbox = 0
smallbox = 0
addto = 0
num = 0
counter = 1
for i in range(0,n):
num += 1
if (num > boxsize):
num -= boxsize
addto = 1-addto
if (addto):
bigbox += counter
else:
smallbox += counter
counter *= 2
print("A=(((A&"+str(bigbox)+")>>"+str(boxsize)+")+(A&"+str(smallbox)+"))")
numboxes = (numboxes+1)//2
boxsize *= 2