CSES - Datatähti 2026 alku

Submission details
Task:	Tulkki
Sender:	Lily2
Submission time:	2025-11-07 19:22:06 +0200
Language:	C
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	RUNTIME ERROR	0
#2	RUNTIME ERROR	0
#3	RUNTIME ERROR	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2, 3	details
#2	RUNTIME ERROR	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.04 s	3	details
#18	ACCEPTED	0.00 s	3	details

Compiler report

input/code.c: In function 'parseBlock':
input/code.c:61:7: warning: ignoring return value of 'fscanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |       fscanf(stdin, " %c", &c->var);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.c:67:7: warning: ignoring return value of 'fscanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |       fscanf(stdin, " %c", &c->repeatVar);
      |       ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.c:68:7: warning: ignoring return value of 'fscanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |       fscanf(stdin, "%*s");  // skip TIMES
      |       ^~~~~~~~~~~~~~~~~~~~
input/code.c:69:7: warning: ignoring return value of 'fscanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |       fscanf(stdin, " (");
      |       ^~~~~~~~~~~~~~~~~~~

Code

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAX_CMDS 1000

typedef enum { CMD_CLEAR, CMD_INCREASE, CMD_PRINT, CMD_REPEAT } CmdType;

typedef struct Command {
  CmdType type;
  char var;
  char repeatVar;
  struct Command **body;
  int bodyCount;
} Command;

int vars[26];

void run(Command **cmds, int count);
Command **parseBlock(int *count);
void freeCommands(Command **cmds, int count);

void run(Command **cmds, int count) {
  for (int i = 0; i < count; i++) {
    Command *c = cmds[i];
    switch (c->type) {
      case CMD_CLEAR:
        vars[c->var - 'A'] = 0;
        break;
      case CMD_INCREASE:
        vars[c->var - 'A']++;
        break;
      case CMD_PRINT:
        printf("%d\n", vars[c->var - 'A']);
        break;
      case CMD_REPEAT: {
        int times = vars[c->repeatVar - 'A'];
        for (int j = 0; j < times; j++) {
          run(c->body, c->bodyCount);
        }
        break;
      }
    }
  }
}

Command **parseBlock(int *count) {
  Command **cmds = malloc(MAX_CMDS * sizeof(Command *));
  *count = 0;
  char token[64];

  while (fscanf(stdin, "%63s", token) == 1) {
    if (strcmp(token, ")") == 0) break;

    if (strcmp(token, "CLEAR") == 0 || strcmp(token, "INCREASE") == 0 ||
        strcmp(token, "PRINT") == 0) {
      Command *c = malloc(sizeof(Command));
      c->type = strcmp(token, "CLEAR") == 0      ? CMD_CLEAR
                : strcmp(token, "INCREASE") == 0 ? CMD_INCREASE
                                                 : CMD_PRINT;
      fscanf(stdin, " %c", &c->var);
      cmds[(*count)++] = c;

    } else if (strcmp(token, "REPEAT") == 0) {
      Command *c = malloc(sizeof(Command));
      c->type = CMD_REPEAT;
      fscanf(stdin, " %c", &c->repeatVar);
      fscanf(stdin, "%*s");  // skip TIMES
      fscanf(stdin, " (");
      c->body = parseBlock(&c->bodyCount);
      cmds[(*count)++] = c;

    } else if (token[0] == '#') {
      while (fgetc(stdin) != '\n' && !feof(stdin));
    }
  }
  return cmds;
}

void freeCommands(Command **cmds, int count) {
  for (int i = 0; i < count; i++) {
    if (cmds[i]->type == CMD_REPEAT)
      freeCommands(cmds[i]->body, cmds[i]->bodyCount);
    free(cmds[i]);
  }
  free(cmds);
}

int main() {
  int count;
  Command **cmds = parseBlock(&count);
  run(cmds, count);
  freeCommands(cmds, count);
  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: RUNTIME ERROR

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

correct output
`1 3` view save

user output
(empty)

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 ...` 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 ...` 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 ...` 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 ...` 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 ...` 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 (Lily2)