Bittilista

n, k = map(lambda x : int(x), input().split())


def check(num):
    balance = 0
    for i in range(len(num) - 1):
        if num[i:i + 2] == '01':
            balance += 1
        elif num[i:i + 2] == '10':
            balance -= 1
    return balance == 0
        
def pad(num, n):
    m = n - len(num)
    output = '0' * m
    return output + num

ord = 0
counter = 0

for i in range(2 ** n):
    binary = str(bin(ord))[2::]
    if len(binary) < n:
        binary = pad(binary, n)
    if check(binary):
        counter += 1
    if counter == k:
        break
    ord += 1

print(binary)

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED