Stage I syllabus

At stage I each league solves eight problems. The junior league is grades 6–7, the senior league grades 8–11. Some problems are shared by both leagues.

Problem	What it needs	Junior	Senior
A	One of the five problems in this set	yes	yes
B	One of the ten problems in this set	yes	yes
C	A formula, no if/else.	yes	no
D	if/else with a simple condition (no AND/OR), printing one of two answers: YES/NO, ALICE/BOB and the like.	yes	yes
E	if/else with a simple condition (no AND/OR).	yes	no
F	Several if/else and/or a compound condition.	yes	yes
G	if/else, AND/OR, integer arithmetic (addition, subtraction, multiplication, division, remainder), printing strings — nothing hard.	yes	no
H	while/for and everything from the problems above — nothing harder.	yes	yes
I	Arrays — nothing harder.	no	yes
J	Strings, vectors, binary search, sorting, containers (set, map), finding divisors, prime factorisation, the sieve of Eratosthenes, GCD/LCM and Euclid’s algorithm, 1D dynamic programming, prefix sums — nothing hard.	no	yes
K	The same topics as problem J.	no	yes

Problems A and B come from sets published in advance: you can solve all of them before the olympiad.

For how to prepare more broadly, see How to prepare.