Submission #56609635

---

Source Code Expand

def dfs(n, k, x):
    if k == 0:
        if x == 0:
            x = 1
        return [x] * n
    m = (n + 1) // 2
    # m = min(n, o)
    ret = dfs(m, k-1, x*2+1)
    if n-m > 0:
        b = dfs(n-m, k-1, x*2)
        ret += b
    return ret

def check(a):
    s = set()
    for x in a:
        y = 1
        while y <= x:
            s.add(x//y)
            y *= 2
    s = sorted(list(s))
    print(len(s), s)


def solve():
    n, k = map(int, input().split())
    ret = dfs(n, k-1, 1)
    ret.sort()
    print(*ret)
    # check(ret)


t = int(input())
for ti in range(t):
    solve()

Submission Info

Judge Result