Submission #54342006

Source Code Expand

n = int(input())

now = ['#']
for i in range(n):
    nxt = [['.']*3**(i+1) for _ in range(3**(i+1))]
    for l in range(3):
        for m in range(3):
            # for aaa in range(len(nxt)):
            #     print(''.join(nxt[aaa]))
            if l==m==1: continue
            ll = len(now)*l
            mm = len(now)*m
            for j in range(len(now)):
                for k in range(len(now)):
                    nxt[j+ll][k+mm] = now[j][k]
    now = nxt

for i in range(len(now)):
    print(''.join(now[i]))

Submission Info

Submission Time
Task C - Sierpinski carpet
User noriaoki
Language Python (PyPy 3.10-v7.3.12)
Score 250
Code Size 538 Byte
Status AC
Exec Time 71 ms
Memory 81856 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 250 / 250
Status
AC × 2
AC × 9
Set Name Test Cases
Sample example_00.txt, example_01.txt
All example_00.txt, example_01.txt, test_00.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt
Case Name Status Exec Time Memory
example_00.txt AC 56 ms 76420 KiB
example_01.txt AC 56 ms 76304 KiB
test_00.txt AC 62 ms 81508 KiB
test_01.txt AC 56 ms 76348 KiB
test_02.txt AC 60 ms 81392 KiB
test_03.txt AC 56 ms 76336 KiB
test_04.txt AC 56 ms 76444 KiB
test_05.txt AC 71 ms 81856 KiB
test_06.txt AC 58 ms 76372 KiB