Informatics

Where this comes from

Project Cherenkov writes this syllabus itself, from the sources below. Each topic is labelled with the syllabuses that list it.

OSNSilabus OSN Bidang Informatika
National syllabus · Issued by IA TOKI (Ikatan Alumni TOKI) · Edition: OSN 2026 · Official language: Indonesian
Compared with the primary document · Last compared October 24, 2026
Names in English are unofficial glosses written by Project Cherenkov, so check the source if in doubt.
The IA TOKI page says this syllabus follows the IOI syllabus with various adjustments, and links the Ministry’s OSN guide.
IOIThe International Olympiad in Informatics Syllabus
International syllabus · Issued by International Olympiad in Informatics (International Scientific Committee) · Edition: Version used for IOI 2025 · Official language: English
Compared with the primary document · Last compared November 10, 2026
The text calls this the official version for IOI 2025, although the PDF’s footer still says “DRAFT”. No version for IOI 2026 has been found.

What is Project Cherenkov’s own: the subtopics, the translations into the other language, and the pairing of a topic with a source that does not state it itself. Section pointers such as “IPhO §2.4.3” name the place in the source where a topic comes from.

58 topics · 1 material · 1 editorial

Show topics from

Each label says which syllabuses list the topic. “Not confirmed” means we have not found the topic in that source; it does not mean the topic is excluded.

Theory

Programming Fundamentals5 topics

Basic syntax and semantics of the language permitted in the relevant OSN
OSN and IOIIOI PF1
Coming soon
Variables, data types, expressions, and assignment
OSN and IOIIOI PF1
Coming soon
Basic input and output
OSN and IOIIOI PF1
Coming soon
Branching and loops
OSN and IOIIOI PF1
Coming soon
Functions and parameters
OSN and IOIIOI PF1
Coming soon

Logic and Bitwise Operations3 topics

Basic logical operators (conjunction, disjunction, implication, biconditional, exclusive or)
OSN and IOIIOI DS2
Coming soon
Truth tables
OSN and IOIIOI DS2
Coming soon
Modus ponens and modus tollens
OSN and IOIIOI DS2
Coming soon

Arithmetic8 topics

Integers, operations (including exponentiation), comparison
OSN and IOIIOI §5.1
Coming soon
Integer properties (sign, parity, divisibility)
OSN and IOIIOI §5.1
Coming soon
Basic modular operations (addition, subtraction, multiplication)
OSN and IOIIOI §5.1
Coming soon
Modular exponentiation
OSN only
Coming soon
Prime numbers
OSN and IOIIOI §5.1
Coming soon
Fractions and percentages
OSN and IOIIOI §5.1
Coming soon
Number theory
OSN only
Coming soon
Set theory
OSN and IOIIOI DS1
Coming soon

Counting Rules8 topics

Sum and product rules
OSN and IOIIOI DS4
Coming soon
Arithmetic and geometric sequences
OSN and IOIIOI DS4
Coming soon
Fibonacci numbers
OSN and IOIIOI DS4
Coming soon
Permutations and combinations
OSN and IOIIOI DS4
Coming soon
Probability
OSN only
Coming soon
Pigeonhole principle
OSN and IOIIOI DS4
Coming soon
Inclusion–exclusion principle
OSN and IOIIOI DS4
Coming soon
Pascal’s triangle, binomial theorem
OSN and IOIIOI DS4
Coming soon

Recursion5 topics

The concept of recursion
OSN and IOIIOI PF4
Coming soon
Recursive mathematical functions
OSN and IOIIOI PF4
Coming soon
Simple recursive procedures
OSN and IOIIOI PF4
Coming soon
Divide and conquer
OSN and IOIIOI PF4
Coming soon
Backtracking
OSN and IOIIOI PF4
Coming soon

Searching and Sorting4 topics

Linear search
OSN and IOIIOI AL3a
Coming soon
Binary search
OSN and IOIIOI AL3a
Editorials:Binary search on the answer: why the predicate must be monotonic
Read material →
Bubble sort, insertion sort
OSN only
Coming soon
Quicksort, merge sort, heapsort
OSN and IOIIOI AL3a
Coming soon

Problem-Solving Strategies4 topics

Complete search (brute force and pruning strategies)
OSN and IOIIOI AL2
Coming soon
Greedy algorithms
OSN and IOIIOI AL2
Coming soon
Divide and conquer
OSN and IOIIOI AL2
Coming soon
Dynamic programming
OSN and IOIIOI AL2
Coming soon

Data Structures7 topics

Primitive data types (boolean, integer, character, floating-point numbers)
OSN and IOIIOI PF3
Coming soon
Arrays (including multidimensional)
OSN and IOIIOI PF3
Coming soon
Strings and their operations
OSN and IOIIOI PF3
Coming soon
Stacks and queues
OSN and IOIIOI AL3b
Coming soon
Binary heap
OSN and IOIIOI AL3b
Coming soon
Disjoint set
OSN and IOIIOI AL3b
Coming soon
Point update, range query (e.g. with a Fenwick tree or segment tree)
OSN and IOIIOI AL3b
Coming soon

Graphs and Trees8 topics

Basic trees (including rooted trees)
OSN and IOIIOI DS5
Coming soon
Directed and undirected graphs
OSN and IOIIOI DS5
Coming soon
Weighted and unweighted graphs
OSN only
Coming soon
Graph representation (adjacency list, adjacency matrix, edge list)
OSN and IOIIOI AL3b
Coming soon
Graph traversal (BFS, DFS, connectivity)
OSN and IOIIOI AL3a
Coming soon
Shortest paths (Dijkstra, Bellman–Ford, Floyd–Warshall)
OSN and IOIIOI AL3a
Coming soon
Minimum spanning trees (Prim, Kruskal)
OSN and IOIIOI AL3a
Coming soon
Lowest common ancestor (LCA)
OSN and IOIIOI AL3b
Coming soon

Basic Geometry6 topics

Lines, line segments, angles
OSN and IOIIOI §5.1
Coming soon
Triangles, squares, rectangles, circles
OSN and IOIIOI §5.1
Coming soon
Points and coordinates on the 2D Cartesian plane
OSN and IOIIOI §5.1
Coming soon
Euclidean distance
OSN and IOIIOI §5.1
Coming soon
Pythagorean theorem
OSN and IOIIOI §5.1
Coming soon
Definition of the convex hull
OSN and IOIIOI AL10
Coming soon

Informatics

Where this comes from

Theory

Basic syntax and semantics of the language permitted in the relevant OSN

Variables, data types, expressions, and assignment

Basic input and output

Branching and loops

Functions and parameters

Basic logical operators (conjunction, disjunction, implication, biconditional, exclusive or)

Truth tables

Modus ponens and modus tollens

Integers, operations (including exponentiation), comparison

Integer properties (sign, parity, divisibility)

Basic modular operations (addition, subtraction, multiplication)

Modular exponentiation

Prime numbers

Fractions and percentages

Number theory

Set theory

Sum and product rules

Arithmetic and geometric sequences

Fibonacci numbers

Permutations and combinations

Probability

Pigeonhole principle

Inclusion–exclusion principle

Pascal’s triangle, binomial theorem

The concept of recursion

Recursive mathematical functions

Simple recursive procedures

Divide and conquer

Backtracking

Linear search

Binary search

Bubble sort, insertion sort

Quicksort, merge sort, heapsort

Complete search (brute force and pruning strategies)

Greedy algorithms

Divide and conquer

Dynamic programming

Primitive data types (boolean, integer, character, floating-point numbers)

Arrays (including multidimensional)

Strings and their operations

Stacks and queues

Binary heap

Disjoint set

Point update, range query (e.g. with a Fenwick tree or segment tree)

Basic trees (including rooted trees)

Directed and undirected graphs

Weighted and unweighted graphs

Graph representation (adjacency list, adjacency matrix, edge list)

Graph traversal (BFS, DFS, connectivity)

Shortest paths (Dijkstra, Bellman–Ford, Floyd–Warshall)

Minimum spanning trees (Prim, Kruskal)

Lowest common ancestor (LCA)

Lines, line segments, angles

Triangles, squares, rectangles, circles

Points and coordinates on the 2D Cartesian plane

Euclidean distance

Pythagorean theorem

Definition of the convex hull