제출 #251596

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
251596		Bruteforceman	Popcount (COCI19_popcount)	Cpython 3	110 / 110	32 ms	3564 KiB

popcount

import math
import sys
input = sys.stdin.readline
n, k = map(int, input().split())
def value(a) :
    ans = 0
    for i in range(len(a)):
        if a[i] == 1:
            ans += 1 << i
    return str(ans)
a = [(i, i) for i in range(n)]
sz = 1
result = []

while len(a) > 0: 
    s = [0] * n
    t = [0] * n
    b = []
    for i in range(1, len(a), 2):
        for j in range(a[i - 1][0], a[i - 1][1] + 1):
            s[j] = 1
        for j in range(a[i][0], a[i][1] + 1):
            t[j] = 1
        b.append((a[i - 1][0], a[i][1]))
    exp = '((A&' + value(s) + ')+((A&' + value(t) + ')>>' + str(sz) + '))'
    if len(a) % 2 == 1:
        s = [0] * n
        t = [0] * n
        for j in range(a[-1][0], a[-1][1] + 1):
            s[j] = 1
        for j in range(a[-1][1] + 1, n):
            t[j] = 1
        extra = '((A&' + value(s) + ')+((A&' + value(t) + ')>>' + str(sz) + '))'
    else:
        s = [0] * n
        for j in range(a[-1][1] + 1, n):
            s[j] = 1
        extra = '(A&' + value(s) + ')' 
    exp = '(' + exp + '|' + extra + ')'
    result.append('A=' + exp)
    a = b[:]
    sz *= 2
if len(result) > k:
    result = result[:k]        
print(len(result))
print('\n'.join(result))

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 35 / 35
• Subtask 4: 45 / 45