CSES - Datatähti 2026 alku

Submission details
Task:	Tulkki
Sender:	nikke5
Submission time:	2025-11-06 14:13:04 +0200
Language:	C++ (C++11)
Status:	READY
Result:	44

Feedback
group	verdict	score
#1	ACCEPTED	12
#2	ACCEPTED	32
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2, 3	details
#2	ACCEPTED	0.00 s	1, 2, 3	details
#3	ACCEPTED	0.00 s	1, 2, 3	details
#4	ACCEPTED	0.00 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.00 s	1, 2, 3	details
#7	ACCEPTED	0.00 s	2, 3	details
#8	ACCEPTED	0.00 s	2, 3	details
#9	ACCEPTED	0.00 s	2, 3	details
#10	ACCEPTED	0.00 s	2, 3	details
#11	ACCEPTED	0.00 s	2, 3	details
#12	ACCEPTED	0.00 s	2, 3	details
#13	ACCEPTED	0.00 s	3	details
#14	ACCEPTED	0.00 s	3	details
#15	ACCEPTED	0.03 s	3	details
#16	WRONG ANSWER	0.00 s	3	details
#17	WRONG ANSWER	0.04 s	3	details
#18	TIME LIMIT EXCEEDED	--	3	details

Compiler report

input/code.cpp: In function 'void repeatNested(int, std::vector<std::__cxx11::basic_string<char> >)':
input/code.cpp:37:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for (int i = 0; i < comingInputs.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~~~~~~~
input/code.cpp:93:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |         for (int i = 0; i < inputs.size(); i++)
      |                         ~~^~~~~~~~~~~~~~~
input/code.cpp: In function 'void executeCode(std::vector<int>)':
input/code.cpp:123:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |     for (int i = 0; i < code...

Code

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <chrono>
#include <iomanip>

typedef long long ll;
using namespace std;

int variables[25] = {0};

void clear(int var)
{
    variables[var - 65] = 0;
}

void increase(int var)
{
    variables[var - 65]++;
}

void print(int var)
{
    cout << variables[var - 65] << " ";
}

void repeatNested(int repeattimes, vector<string> comingInputs)
{
    vector<string> inputs;
    vector<char> inputs2;

    vector<string> repeatInputs[1000];

    for (int i = 0; i < comingInputs.size(); i++)
    {
        string input = comingInputs[i];
        if (input == "CLEAR")
        {
            i++;
            char input2 = comingInputs[i][0];
            inputs.push_back(input);
            inputs2.push_back(input2);
        }

        if (input == "INCREASE")
        {
            i++;
            char input2 = comingInputs[i][0];
            inputs.push_back(input);
            inputs2.push_back(input2);
        }

        if (input == "PRINT")
        {
            i++;
            char input2 = comingInputs[i][0];
            inputs.push_back(input);
            inputs2.push_back(input2);
        }

        if (input == "REPEAT")
        {
            i++;
            char input2 = comingInputs[i][0];

            inputs.push_back(input);
            inputs2.push_back(input2);

            int nestAmount = 1;

            while (nestAmount > 0)
            {
                i++;
                repeatInputs[inputs.size() - 1].push_back(comingInputs[i]);
                // cout << comingInputs[i] << " - ";

                if (comingInputs[i] == "(")
                {
                    nestAmount++;
                }
                if (comingInputs[i] == ")")
                {
                    nestAmount--;
                }
            }
        }
    }
    for (int c = 0; c < repeattimes; c++)
    {
        for (int i = 0; i < inputs.size(); i++)
        {
            string input = inputs[i];
            if (input == "CLEAR")
            {
                char input2 = inputs2[i];
                clear(variables[input2 - 65]);
            }
            if (input == "INCREASE")
            {
                char input2 = inputs2[i];
                increase(variables[input2 - 65]);
            }
            if (input == "PRINT")
            {
                char input2 = inputs2[i];
                print(variables[input2 - 65]);
            }
            if (input == "REPEAT")
            {
                char input2 = inputs2[i];
                repeatNested(variables[input2 - 65], repeatInputs[i]);
            }
        }
    }
}

void executeCode(vector<int> code)
{

    for (int i = 0; i < code.size(); i++)
    {
        if (code[i] == 0)
        {
            i++;
            clear(code[i]);
        }

        if (code[i] == 1)
        {
            i++;
            increase(code[i]);
        }

        if (code[i] == 2)
        {
            i++;
            print(code[i]);
        }

        if (code[i] == 3)
        {
            i++;

            int repeatTimes = variables[code[i] - 65];
            vector<int> code2;

            int nestAmount = 1; // 1 because it starts from a REPEAT

            i++; // add 1 to i so the loop below doesnt take the REPEAT X -> X into account

            for (int c = i; c < code.size(); c++)
            {
                i++; // make sure the main code skips the repeat stuff and lets this section handle it

                if (code[c] == 3)
                {
                    nestAmount++;
                }
                if (code[c] == 4)
                {
                    nestAmount--;
                    if (nestAmount < 1){
                        break; // break here so the last ) doesnt get added to the executed repeat code because this belongs to the parent function
                    }
                }


                code2.push_back(code[c]);


            }

            for (int c = 0; c < repeatTimes; c++)
            {
                executeCode(code2);
            }
        }
    }
}

int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    string input;

    while (cin >> input)
    {

        if (input == "stop")
        {
            break;
        }

        int commentPos = input.find("#");

        if (commentPos != -1)
        {
            input.erase(commentPos);
            string temp;
            getline(cin, temp);
        }

        if (input == "#")
        {
            getline(cin, input);
            continue;
        }

        if (input == "CLEAR")
        {
            char input2;
            cin >> input2;
            while (input2 == '#')
            {
                getline(cin, input);
                cin >> input2;
            }

            vector<int> code = {0, input2};
            executeCode(code);
        }

        if (input == "INCREASE")
        {

            char input2;
            cin >> input2;
            while (input2 == '#')
            {
                getline(cin, input);
                cin >> input2;
            }
            vector<int> code = {1, input2};
            executeCode(code);
        }

        if (input == "PRINT")
        {
            char input2;
            cin >> input2;
            while (input2 == '#')
            {
                getline(cin, input);
                cin >> input2;
            }
            vector<int> code = {2, input2};
            executeCode(code);
        }

        if (input == "REPEAT")
        {
            char input2;
            cin >> input2;
            while (input2 == '#')
            {
                getline(cin, input);
                cin >> input2;
            }
            vector<int> code = {3, input2};

            int nestAmount = 0;
            while (cin >> input)
            {

                int commentPos = input.find("#");
                if (commentPos != -1)
                {
                    input.erase(commentPos);
                    string temp;
                    getline(cin, temp);
                }

                if (input == "(")
                {
                    nestAmount++;
                    if (nestAmount == 1)
                    {
                        continue;
                    }
                }

                if (input == "CLEAR")
                {
                    char input2;
                    cin >> input2;
                    while (input2 == '#')
                    {
                        getline(cin, input);
                        cin >> input2;
                    }
                    code.push_back(0);
                    code.push_back(input2);
                }

                if (input == "INCREASE")
                {
                    char input2;
                    cin >> input2;
                    while (input2 == '#')
                    {
                        getline(cin, input);
                        cin >> input2;
                    }
                    code.push_back(1);
                    code.push_back(input2);
                }

                if (input == "PRINT")
                {
                    char input2;
                    cin >> input2;
                    while (input2 == '#')
                    {
                        getline(cin, input);
                        cin >> input2;
                    }
                    code.push_back(2);
                    code.push_back(input2);
                }

                if (input == "REPEAT")
                {
                    char input2;
                    cin >> input2;
                    while (input2 == '#')
                    {
                        getline(cin, input);
                        cin >> input2;
                    }
                    code.push_back(3);
                    code.push_back(input2);
                }

                if (input == ")")
                {
                    code.push_back(4);
                    if (nestAmount == 1)
                        break;
                    else
                        nestAmount--;
                }
            }

            executeCode(code);
        }
    }
}

Test details

Test 1 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`PRINT X INCREASE X PRINT X INCREASE X PRINT X ...` view save

correct output
`0 1 2 0` view save

user output
`0 1 2 0` view save

Test 2 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`INCREASE X # aybabtu PRINT X INCREASE # test ...` view save

correct output
`1 3` view save

user output
`1 3` view save

Test 3 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`# Create number 3 INCREASE X INCREASE X INCREASE X ...` view save

correct output
`3` view save

user output
`3` view save

Test 4 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`INCREASE A PRINT A INCREASE B PRINT B INCREASE C ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

Test 5 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`INCREASE X INCREASE X INCREASE X INCREASE X INCREASE X ...` view save

correct output
`999` view save

user output
`999` view save

Test 6 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`PRINT X PRINT X PRINT X PRINT X PRINT X ...` view save

correct output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 7 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`5 5 5 5 5` view save

user output
`5 5 5 5 5` view save

Test 8 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`0 0 0 0 0` view save

user output
`0 0 0 0 0` view save

Test 9 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`6 7 8 9 10` view save

user output
`6 7 8 9 10` view save

Test 10 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`5 5` view save

user output
`5 5` view save

Test 11 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`20` view save

user output
`20` view save

Test 12 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE B INCREASE B ...` view save

correct output
`42` view save

user output
`42` view save

Test 13 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`1 2 2 3 3 3 4 4 4 4 5 5 5 5 5` view save

user output
`1 2 2 3 3 3 4 4 4 4 5 5 5 5 5` view save

Test 14 (public)

Group: 3

Verdict: ACCEPTED

input
`# Create number 3 INCREASE A INCREASE A INCREASE...` view save

correct output
`12` view save

user output
`12` view save

Test 15 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE X INCREASE X INCREASE X INCREASE X INCREASE X ...` view save

correct output
`531441` view save

user output
`531441` view save

Test 16 (public)

Group: 3

Verdict: WRONG ANSWER

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`1337` view save

user output
`1120` view save

Feedback: Incorrect character on line 1 col 2: expected "1337", got "1120"

Test 17 (public)

Group: 3

Verdict: WRONG ANSWER

input
`INCREASE A INCREASE A REPEAT A TIMES ( REPEAT A TIMES ( ...` view save

correct output
`1 2 1 2 1 1 3 4 3 4 3 4 3 4 3 ...` view save

user output
`2 1 2 1 1 4 3 4 3 4 3 4 3 4 3 ...` view save

Feedback: Output is shorter than expected

Test 18 (public)

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`# Efficient algorithm for find...` view save

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

user output
(empty)

Datatähti 2026 alku

Tulkki

Compiler report

Code

Test details

Test 1 (public)

Test 2 (public)

Test 3 (public)

Test 4 (public)

Test 5 (public)

Test 6 (public)

Test 7 (public)

Test 8 (public)

Test 9 (public)

Test 10 (public)

Test 11 (public)

Test 12 (public)

Test 13 (public)

Test 14 (public)

Test 15 (public)

Test 16 (public)

Test 17 (public)

Test 18 (public)

Tasks

Submissions (nikke5)