Submission details
Task:Tulkki
Sender:raikasdev
Submission time:2025-10-28 01:51:00 +0200
Language:Python3 (PyPy3)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED12
#2ACCEPTED32
#3ACCEPTED56
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1, 2, 3details
#2ACCEPTED0.04 s1, 2, 3details
#3ACCEPTED0.04 s1, 2, 3details
#4ACCEPTED0.04 s1, 2, 3details
#5ACCEPTED0.06 s1, 2, 3details
#6ACCEPTED0.06 s1, 2, 3details
#7ACCEPTED0.04 s2, 3details
#8ACCEPTED0.04 s2, 3details
#9ACCEPTED0.04 s2, 3details
#10ACCEPTED0.04 s2, 3details
#11ACCEPTED0.04 s2, 3details
#12ACCEPTED0.04 s2, 3details
#13ACCEPTED0.04 s3details
#14ACCEPTED0.04 s3details
#15ACCEPTED0.15 s3details
#16ACCEPTED0.05 s3details
#17ACCEPTED0.14 s3details
#18ACCEPTED0.09 s3details

Code

# Tulkki

def main():
  program = ""
  while True:
    try:
      line = input()
      program += line + "\n"
    except EOFError:
      break

  if "#" in program:
    # Lets process to eliminate comments
    lines = program.split("\n")
    line_index = 0
    while line_index < len(lines):
      line = lines[line_index]
      if "#" in line:
        comment_index = line.index("#")
        if comment_index == 0:
          del lines[line_index]
          continue
        lines[line_index] = line[0:comment_index]
      line_index += 1
    program = " ".join(lines)
  program = program.replace("\n", " ").split(" ")

  def parse_tokens(tokens):
    commands = []
    temp_command = None
    while len(tokens) > 0:
      token = tokens.pop(0)
      
      # PyPy is only 3.8 so can't use match
      if temp_command == None:
        temp_command = token
      else:
        if temp_command == "REPEAT":
          # Skip "TIMES"
          times = tokens.pop(0)
          #print(times, "should be TIMES", times == "TIMES")
          # Skip opening paranthese
          op_par = tokens.pop(0)
          #print(op_par, "should be (", op_par == "(")
          sub_program = []
          sub_token = tokens.pop(0)
          inner_closed = 0
          while sub_token != ")" or inner_closed != 0:
            if sub_token == "(":
              inner_closed += 1
            if sub_token == ")":
              inner_closed -= 1
            sub_program.append(sub_token)

            sub_token = tokens.pop(0)

          commands.append((temp_command, token, parse_tokens(sub_program)))
          # Skip next token
        else:
          commands.append((temp_command, token))
        temp_command = None
    return commands

  program_commands = parse_tokens(list(filter(len, program)))

  def run(commands, variables, output):
    for command in commands:
      var_number = ord(command[1]) - 65
      if command[0] == "INCREASE":
        variables[var_number] = variables[var_number] + 1
      elif command[0] == "CLEAR":
        variables[var_number] = 0
      elif command[0] == "PRINT":
        output.append(variables[var_number])
      elif command[0] == "REPEAT":
        for i in range(variables[var_number]):
          sub_result = run(command[2], variables, output)
          variables = sub_result[0]
          output = sub_result[1]

    return (variables, output)
  
  result = run(program_commands, [0] * 26, [])
  print(" ".join(map(str, result[1])))

  

if __name__ == "__main__":
  main()

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 1 1 1 1 1 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 0 0 0 0 0 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: ACCEPTED

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

correct output
20 

user output
20

Test 12 (public)

Group: 2, 3

Verdict: ACCEPTED

input
INCREASE A
INCREASE A

INCREASE B
INCREASE B
...

correct output
42 

user output
42

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 3 4 4 4 4 5 5 5 5 5

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: ACCEPTED

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

correct output
1337 

user output
1337

Test 17 (public)

Group: 3

Verdict: ACCEPTED

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
1 2 1 2 1 1 3 4 3 4 3 4 3 4 3 ...

Test 18 (public)

Group: 3

Verdict: ACCEPTED

input
# Efficient algorithm for find...

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

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