Submission details
Task:Tulkki
Sender:j-l
Submission time:2025-11-01 20:21:27 +0200
Language:Node.js
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.11 s1, 2, 3details
#20.11 s1, 2, 3details
#30.11 s1, 2, 3details
#40.11 s1, 2, 3details
#50.12 s1, 2, 3details
#60.12 s1, 2, 3details
#7ACCEPTED0.12 s2, 3details
#8ACCEPTED0.12 s2, 3details
#9ACCEPTED0.11 s2, 3details
#100.11 s2, 3details
#110.11 s2, 3details
#120.11 s2, 3details
#13ACCEPTED0.12 s3details
#140.11 s3details
#15--3details
#160.14 s3details
#170.12 s3details
#180.12 s3details

Code

const readline = require('readline');
const rl = readline.createInterface({ input: process.stdin, output: process.stdout });

let alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
for (let i = 0; i < alphabet.length; i++) {
    eval("var " + alphabet[i] + " = 0;");
}

let buffer = "";

function tulkki(input) {
    input = input.toUpperCase();
    input = input.split('#')[0].trim();
    if (input === "") return;

    input = input.replace(/\(/g, ' ( ').replace(/\)/g, ' ) ');
    let tokens = input.split(/\s+/);

    let i = 0;
    while (i < tokens.length) {
        let cmd = tokens[i];

        if (cmd === "INCREASE" || cmd === "CLEAR" || cmd === "PRINT") {
            let v = tokens[i + 1];
            if (alphabet.includes(v)) {
                if (cmd === "INCREASE") eval(v + " += 1;");
                else if (cmd === "CLEAR") eval(v + " = 0;");
                else if (cmd === "PRINT") console.log(eval(v));
            }
            i += 2;
        } else if (cmd === "REPEAT") {
            let v = tokens[i + 1];
            let times = eval(v);
            i += 3; // skip REPEAT X TIMES

            if (tokens[i] !== "(") return;
            i++;

            let depth = 1;
            let block = [];
            while (i < tokens.length && depth > 0) {
                if (tokens[i] === "(") depth++;
                else if (tokens[i] === ")") depth--;
                if (depth > 0) block.push(tokens[i]);
                i++;
            }

            for (let j = 0; j < times; j++) {
                tulkki(block.join(" "));
            }
        } else {
            i++;
        }
    }
}

function questLoop() {
    rl.question("", (line) => {
        buffer += line + "\n";
        if (line.includes(")")) {
            tulkki(buffer);
            buffer = "";
        }
        questLoop();
    });
}

questLoop();

Test details

Test 1 (public)

Group: 1, 2, 3

Verdict:

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

correct output
0 1 2 0 

user output
(empty)

Feedback: Output is shorter than expected

Test 2 (public)

Group: 1, 2, 3

Verdict:

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

correct output
1 3 

user output
(empty)

Feedback: Output is shorter than expected

Test 3 (public)

Group: 1, 2, 3

Verdict:

input
# Create number 3
INCREASE X
INCREASE X
INCREASE X

...

correct output

user output
(empty)

Feedback: Output is shorter than expected

Test 4 (public)

Group: 1, 2, 3

Verdict:

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
(empty)

Feedback: Output is shorter than expected

Test 5 (public)

Group: 1, 2, 3

Verdict:

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

correct output
999 

user output
(empty)

Feedback: Output is shorter than expected

Test 6 (public)

Group: 1, 2, 3

Verdict:

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
(empty)

Feedback: Output is shorter than expected

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:

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

correct output
5 5 

user output
(empty)

Feedback: Output is shorter than expected

Test 11 (public)

Group: 2, 3

Verdict:

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

correct output
20 

user output
(empty)

Feedback: Output is shorter than expected

Test 12 (public)

Group: 2, 3

Verdict:

input
INCREASE A
INCREASE A

INCREASE B
INCREASE B
...

correct output
42 

user output
(empty)

Feedback: Output is shorter than expected

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:

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

correct output
12 

user output
(empty)

Feedback: Output is shorter than expected

Test 15 (public)

Group: 3

Verdict:

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

correct output
531441 

user output
(empty)

Test 16 (public)

Group: 3

Verdict:

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

correct output
1337 

user output
(empty)

Feedback: Output is shorter than expected

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

Feedback: Output is shorter than expected

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

Feedback: Output is shorter than expected