Guide · Informatics competitions
Informatics Competitions – a Preparation Guide
This guide brings together materials for preparing for the informatics competitions for primary schools in Serbia: the municipal competition, the qualifications, the district and national competitions and SIO (the Serbian Informatics Olympiad). For every level there are tasks from previous competitions, hints and solutions, mostly in C++.
Start from the level you are competing at now, and then move on to the topics of the next level.
- Grades 5–8
- Solutions in C++
- Municipal → SIO
Some lessons linked below are available only in Serbian for now. They are marked (SR).
1 The municipal competition
The first level: data, branching, loops and simple arrays.
2 Qualifications for the district competition
Online qualifications: speed and accuracy on shorter tasks.
3 The district competition
Topic plans and an archive of tasks from district competitions.
District competition preparation – grades 5 and 6
Topics, example tasks and interactive tools.
Open lesson →District competition preparation – grades 7 and 8 (SR)
More complex tasks and techniques.
Open lesson →Archive of district tasks (2009–2024) (SR)
Tasks with hints, C++ solutions and a quiz.
Open lesson →4 The national competition and SIO
The highest levels: recursion, dynamic programming, graphs and data structures.
The national competition – tasks and solutions
Tasks from national competitions (2016–2024).
Open lesson →Preparation for the national competition and SIO
A preparation plan and topics for the highest levels.
Open lesson →Interactive algorithms (SR)
Tasks in which the program asks queries and adapts to the answers.
Open lesson →5 Algorithms by topic
The theory needed for tasks from the district level upwards.
Algorithms – guide
An overview of all algorithm lessons.
Open lesson →Recursion and backtracking
Introduction to recursion, factorial and power, backtracking, permutations, Sudoku.
Open lesson →Dynamic programming
From memoization to Knapsack, LCS and DP on a grid.
Open lesson →Graphs and trees
BFS, DFS, shortest paths, MST and advanced techniques.
Open lesson →Data structures
Stack, queue, priority_queue, DSU, the Fenwick tree and the segment tree.
Open lesson →Number theory (SR)
Prime numbers, modular arithmetic and fast exponentiation in one place.
Open lesson →Combinatorics (SR)
Permutations, combinations and counting modulo a number.
Open lesson →Sorting
Merge sort, quick sort, the sort function and comparators.
Open lesson →Binary search
lower_bound, upper_bound and binary search on the answer.
Open lesson →Advanced techniques
Two pointers, prefix sums, greedy algorithms.
Open lesson →Fenwick and segment tree (SR)
Fast queries over intervals of an array with updates.
Open lesson →6 Selected solved tasks
Competition tasks with a detailed explanation of the solution.
Letter rotator
National competition, grade 7: the period of a word and LCM.
Open lesson →Ray
Qualifications: a simulation task.
Open lesson →Millionaire
A solution with an explanation.
Open lesson →A game with the Joker (SR)
A solution and an explanation.
Open lesson →Sums after division
Prefix sums in practice.
Open lesson →A correct expression
The solution of task 15.
Open lesson →