CSES - Datatähti 2026 alku

Submission details
Task:	Tulkki
Sender:	Tmotomaster
Submission time:	2025-10-27 21:00:50 +0200
Language:	C++ (C++20)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	12
#2	ACCEPTED	32
#3	ACCEPTED	56

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.00 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.01 s	3	details
#16	ACCEPTED	0.00 s	3	details
#17	ACCEPTED	0.05 s	3	details
#18	ACCEPTED	0.01 s	3	details

Compiler report

input/code.cpp: In member function 'void Command::exec()':
input/code.cpp:26:12: warning: array subscript has type 'char' [-Wchar-subscripts]
   26 |       vars[var] = 0;
      |            ^~~
input/code.cpp:28:14: warning: array subscript has type 'char' [-Wchar-subscripts]
   28 |       ++vars[var];
      |              ^~~
input/code.cpp:30:20: warning: array subscript has type 'char' [-Wchar-subscripts]
   30 |       cout << vars[var] << ' ';
      |                    ^~~
input/code.cpp:32:30: warning: array subscript has type 'char' [-Wchar-subscripts]
   32 |       int repeatCount = vars[var];
      |                              ^~~
input/code.cpp:34:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Command*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for (int j = 0; j < insides.size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:55:21...

Code

#include <iostream>
#include <string>
#include <vector>
using namespace std;

int vars[26] = {0};

struct Command {
  int type;
  char var;
  vector<Command*> insides;
  Command* parent = nullptr;

  Command(int t, int v, Command* p) {
    type = t;
    var = v - 'A';
    parent = p;
  }

  void addInside(Command* c) {
    insides.push_back(c);
  }

  void exec() {
    if (type == 0) {
      vars[var] = 0;
    } else if (type == 1) {
      ++vars[var];
    } else if (type == 2) {
      cout << vars[var] << ' ';
    } else if (type == 3) {
      int repeatCount = vars[var];
      for (int _ = 0; _ < repeatCount; ++_) {
        for (int j = 0; j < insides.size(); j++) {
          insides[j]->exec();
        }
      }
    }
  }
};

int main() {
  // freopen("test.txt", "r", stdin);
  string code;
  getline(cin, code, (char)EOF);

  vector<Command*> commands;
  bool commenting = false;
  Command* looping = nullptr;
  bool commanding = false;
  bool toLoop = false;
  Command* pendingLooping = nullptr;
  int cType;
  char cVar;
  for (int i = 0; i < code.length(); i++) {
    if (!commenting) {
      if (code[i] == '#') {
        commenting = true;
      }
      if (!commanding) {
        if (code[i] == 'C') {
          commanding = true;
          cType = 0;
          i += 5;
        } else if (code[i] == 'I') {
          commanding = true;
          cType = 1;
          i += 8;
        } else if (code[i] == 'P') {
          commanding = true;
          cType = 2;
          i += 5;
        } else if (code[i] == 'R') {
          commanding = true;
          cType = 3;
          i += 6;
        } else if (code[i] == ')') {
          looping = looping->parent;
        }
      } else if (toLoop) {
        if (code[i] == '(') {
          looping = pendingLooping;
          toLoop = false;
          commanding = false;
        }
      } else if (commanding) {
        if (code[i] >= 'A' && code[i] <= 'Z') {
          cVar = code[i];
          if (cType == 3) {
            toLoop = true;
            pendingLooping = new Command(3, cVar, looping);
            if (looping == nullptr) {
              commands.push_back(pendingLooping);
            } else {
              looping->addInside(pendingLooping);
            }
          } else {
            Command* newCommand = new Command(cType, cVar, looping);
            if (looping == nullptr) {
              commands.push_back(newCommand);
            } else {
              looping->addInside(newCommand);
            }
            commanding = false;
          }
        }
      }
    } else if (code[i] == '\n') {
      commenting = false;
    }
  }
  // parsing done

  for (int i = 0; i < commands.size(); i++) {
    commands[i]->exec();
  }
  return 0;
}

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

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

correct output
`1337` view save

user output
`1337` view save

Test 17 (public)

Group: 3

Verdict: ACCEPTED

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

Test 18 (public)

Group: 3

Verdict: ACCEPTED

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
`2 3 5 7 11 13 17 19 23 29 31 3...` view save

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