Submission #26720965

Source Code Expand

N = int(input())
if N % 2 == 1: 
    exit()
ss = []
for i in range(2**N):
    s = ""
    t = 0
    for j in range(N):
        if i >> j & 1 == 1:
            s += "("
            t += 1
        else:
            s += ")"
            t -= 1
            if t < 0:
                break
    if t != 0:
        continue
    elif t == 0:
        ss.append(s)
ss.sort()
for s in ss:
    print(s)

Submission Info

Submission Time
Task 002 - Encyclopedia of Parentheses（★3）
User umagemarc
Language Python (3.8.2)
Score 3
Code Size 411 Byte
Status AC
Exec Time 1937 ms
Memory 10596 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 3 / 3
Status
AC × 4
AC × 20
Set Name Test Cases
Sample 01_sample_01.txt, 01_sample_02.txt, 01_sample_03.txt, 01_sample_04.txt
All 01_sample_01.txt, 01_sample_02.txt, 01_sample_03.txt, 01_sample_04.txt, 02_all_01.txt, 02_all_02.txt, 02_all_03.txt, 02_all_04.txt, 02_all_05.txt, 02_all_06.txt, 02_all_07.txt, 02_all_08.txt, 02_all_09.txt, 02_all_10.txt, 02_all_11.txt, 02_all_12.txt, 02_all_13.txt, 02_all_14.txt, 02_all_15.txt, 02_all_16.txt
Case Name Status Exec Time Memory
01_sample_01.txt AC 20 ms 9184 KiB
01_sample_02.txt AC 20 ms 9072 KiB
01_sample_03.txt AC 21 ms 8992 KiB
01_sample_04.txt AC 25 ms 9044 KiB
02_all_01.txt AC 20 ms 8888 KiB
02_all_02.txt AC 20 ms 9052 KiB
02_all_03.txt AC 20 ms 9120 KiB
02_all_04.txt AC 21 ms 8880 KiB
02_all_05.txt AC 17 ms 8888 KiB
02_all_06.txt AC 17 ms 8884 KiB
02_all_07.txt AC 17 ms 9000 KiB
02_all_08.txt AC 23 ms 8992 KiB
02_all_09.txt AC 23 ms 8884 KiB
02_all_10.txt AC 49 ms 9124 KiB
02_all_11.txt AC 18 ms 9048 KiB
02_all_12.txt AC 132 ms 8972 KiB
02_all_13.txt AC 17 ms 9120 KiB
02_all_14.txt AC 502 ms 9384 KiB
02_all_15.txt AC 22 ms 9048 KiB
02_all_16.txt AC 1937 ms 10596 KiB