Submission details
Task:Tulkki
Sender:Toitsu
Submission time:2025-10-27 20:06:12 +0200
Language:Python3 (PyPy3)
Status:READY
Result:12
Feedback
groupverdictscore
#1ACCEPTED12
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1, 2, 3details
#2ACCEPTED0.04 s1, 2, 3details
#3ACCEPTED0.04 s1, 2, 3details
#4ACCEPTED0.05 s1, 2, 3details
#5ACCEPTED0.04 s1, 2, 3details
#6ACCEPTED0.05 s1, 2, 3details
#7ACCEPTED0.04 s2, 3details
#8ACCEPTED0.04 s2, 3details
#9ACCEPTED0.04 s2, 3details
#10ACCEPTED0.04 s2, 3details
#11--2, 3details
#12--2, 3details
#13ACCEPTED0.04 s3details
#14ACCEPTED0.04 s3details
#15ACCEPTED0.19 s3details
#16--3details
#17--3details
#18--3details

Code

import sys
import time

variables = {'A': 0, 'B': 0, 'C': 0, 'D': 0, 'E': 0, 'F': 0, 'G': 0, 'H': 0, 'I': 0, 'J': 0, 'K': 0, 'L': 0, 'M': 0, 'N': 0, 'O': 0, 'P': 0, 'Q': 0, 'R': 0, 'S': 0, 'T': 0, 'U': 0, 'V': 0, 'W': 0, 'X': 0, 'Y': 0, 'Z': 0}
CLEAR = "CLEAR"
INCREASE = "INCREASE"
PRINT = "PRINT"
REPEAT = "REPEAT"



raw_code = sys.stdin.read()



def handle_repeat(code):
    code = code.rstrip()
    repeat_times = variables[code[7]]

    # find matching parenthesis
    depth = 0
    end_parenthesis_index = 0
    for i, letter in enumerate(code):
        if letter == "(":
            depth += 1
        elif letter == ")":
            depth -= 1
            if depth == 0:
                end_parenthesis_index = i

    repeat_code = code[17:end_parenthesis_index]

    for i in range(repeat_times):
        run_code(repeat_code)
    
    return code[end_parenthesis_index + 2:]


def run_code(code):
    while len(code) > 0:
        if code.startswith(CLEAR):
            variables[code[6]] = 0
            code = code[7:]
        elif code.startswith(INCREASE):
            variables[code[9]] += 1
            code = code[10:]
        elif code.startswith(PRINT):
            print(variables[code[6]])
            code = code[7:]
        elif code.startswith(REPEAT):
            code = handle_repeat(code)
        
        code = code.lstrip()

# parse commands
hashtag_index = raw_code.find("#")
while hashtag_index >= 0:
    if hashtag_index >= 0:
        raw_code = raw_code[:hashtag_index] + raw_code[raw_code.find("\n", hashtag_index):]

    hashtag_index = raw_code.find("#")
        
raw_code = raw_code.replace("\n", " ")
raw_code = " ".join(raw_code.split()).lstrip()




run_code(raw_code)

"""
INCREASE X
INCREASE X
REPEAT X TIMES ( INCREASE Y )
PRINT X
PRINT Y
"""


"""
INCREASE
X
# aybabtu
   PRINT    X
INCREASE # test
X  INCREASE X PRINT#X
X
"""

Test details

Test 1 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
PRINT X
INCREASE X
PRINT X
INCREASE X
PRINT X
...

correct output
0 1 2 0 

user output
0
1
2
0

Test 2 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
INCREASE
X
# aybabtu
   PRINT    X
INCREASE # test
...

correct output
1 3 

user output
1
3

Test 3 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
# Create number 3
INCREASE X
INCREASE X
INCREASE X

...

correct output

user output
3

Test 4 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
INCREASE A
PRINT A
INCREASE B
PRINT B
INCREASE C
...

correct output
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
1
1
1
1
1
...

Test 5 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
INCREASE X
INCREASE X
INCREASE X
INCREASE X
INCREASE X
...

correct output
999 

user output
999

Test 6 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
PRINT X
PRINT X
PRINT X
PRINT X
PRINT X
...

correct output
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...

user output
0
0
0
0
0
...

Test 7 (public)

Group: 2, 3

Verdict: ACCEPTED

input
INCREASE A
INCREASE A
INCREASE A
INCREASE A
INCREASE A
...

correct output
5 5 5 5 5 

user output
5
5
5
5
5

Test 8 (public)

Group: 2, 3

Verdict: ACCEPTED

input
INCREASE A
INCREASE A
INCREASE A
INCREASE A
INCREASE A
...

correct output
0 0 0 0 0 

user output
0
0
0
0
0

Test 9 (public)

Group: 2, 3

Verdict: ACCEPTED

input
INCREASE A
INCREASE A
INCREASE A
INCREASE A
INCREASE A
...

correct output
6 7 8 9 10 

user output
6
7
8
9
10

Test 10 (public)

Group: 2, 3

Verdict: ACCEPTED

input
INCREASE A
INCREASE A
INCREASE A
INCREASE A
INCREASE A
...

correct output
5 5 

user output
5
5

Test 11 (public)

Group: 2, 3

Verdict:

input
INCREASE A
INCREASE A
INCREASE A
INCREASE A
INCREASE A
...

correct output
20 

user output
(empty)

Test 12 (public)

Group: 2, 3

Verdict:

input
INCREASE A
INCREASE A

INCREASE B
INCREASE B
...

correct output
42 

user output
(empty)

Test 13 (public)

Group: 3

Verdict: ACCEPTED

input
INCREASE A
INCREASE A
INCREASE A
INCREASE A
INCREASE A
...

correct output
1 2 2 3 3 3 4 4 4 4 5 5 5 5 5 

user output
1
2
2
3
3
...

Test 14 (public)

Group: 3

Verdict: ACCEPTED

input
# Create number 3
INCREASE A INCREASE A INCREASE...

correct output
12 

user output
12

Test 15 (public)

Group: 3

Verdict: ACCEPTED

input
INCREASE X
INCREASE X
INCREASE X
INCREASE X
INCREASE X
...

correct output
531441 

user output
531441

Test 16 (public)

Group: 3

Verdict:

input
INCREASE A
INCREASE A
INCREASE A
INCREASE A
INCREASE A
...

correct output
1337 

user output
(empty)

Test 17 (public)

Group: 3

Verdict:

input
INCREASE A
INCREASE A

REPEAT A TIMES (
    REPEAT A TIMES (
...

correct output
1 2 1 2 1 1 3 4 3 4 3 4 3 4 3 ...

user output
(empty)

Test 18 (public)

Group: 3

Verdict:

input
# Efficient algorithm for find...

correct output
2 3 5 7 11 13 17 19 23 29 31 3...

user output
(empty)