IOI Track

What is IOI?

An overview of the International Olympiad in Informatics.

What is BdOI?

An overview of the Bangladesh Olympiad in Informatics.

Track Overview

What this track covers and how to use it.

Judging and Platforms

How online judges work and what platforms to use.

Environment and IDE Setup

Setting up a C++ development environment and a beginner-friendly IDE.

Your First Program

Writing and submitting your first 'Hello, World!' program.

Basic I/O

Reading input from and writing output to standard streams.

Debugging Techniques

Basic techniques for debugging your code.

Time Complexity Introduction

A gentle introduction to time complexity and Big O notation.

What This Unit Covers

Explaining the scope of this unit.

Hello, World!

Writing your first C++ program.

Variables

Learn how to store and manage data using variables in C++.

Comments

Putting notes on your code.

Input and Output

Learning to interact with your program: taking input and displaying output.

Built-in Types

Fundamental data types in C++.

Type Casting

Converting value from one type to another.

Operators

Performing operations on literals and variables.

Conditionals

Making decisions in your program.

Switch Statement

Switch: Specialized Conditional Syntax for Testing a Value.

Loops

Running some code repeatedly.

Scope

Understanding variable scope in C++.

Functions

Defining and calling functions to organize code.

Strings

Manipulating text data using `std::string`.

Pointers and References

Understanding memory addresses and aliases in C++.

Pairs

Using `std::pair` to store two heterogeneous objects.

Structs

Defining custom data types with structures in C++.

Templates

Introduction to C++ templates for generic programming.

Arrays

Storing collections of elements with fixed-size arrays.

Vectors

Working with dynamic arrays using `std::vector`.

Deques

Using `std::deque` for double-ended queues.

Maps

Associative containers for key-value pairs using `std::map`.

Bruteforce

An introduction to bruteforce algorithms.

Complete Search

Exploring the complete search (brute-force) approach to problem-solving.

Introduction to Recursion

Understanding the concept of recursion.

Recursive Backtracking

Solving problems with recursive backtracking.

Bubble and Selection Sort

Understanding simple sorting algorithms.

Merge and Quick Sort

Efficient sorting algorithms.

Custom Comparators

Sorting with custom comparison functions.

Binary Search on Array

Applying binary search on sorted arrays.

Binary Search the Answer

Using binary search to find the answer to a problem.

Greedy Algorithms

An introduction to greedy algorithms.

Two Pointers

An introduction to the two-pointer technique.

Prefix Sums

Learn how to use prefix sums to efficiently calculate subarray sums.

Bitwise Operators

Understanding and using bitwise operators in competitive programming.

Modular Arithmetic

Basic operations in modular arithmetic.

Basic Modular Arithmetic

Learn the basics of modular arithmetic, including addition, subtraction, and multiplication.

Primes and Divisors

Generating prime numbers and finding divisors.

Basic Number Theory

An introduction to basic number theory concepts like GCD, LCM, and prime factorization.

Introduction to Dynamic Programming

The core concepts of dynamic programming.

Coin Change

The classic coin change problem.

Knapsack DP

The 0/1 knapsack problem.

Longest Common Subsequence

The longest common subsequence (LCS) problem.

Bitmask DP

Learn how to solve problems with dynamic programming and bitmasking.

DP on Trees

Learn how to apply dynamic programming on tree data structures.

Depth-First Search (DFS)

The DFS algorithm and its applications.

Breadth-First Search (BFS)

The BFS algorithm and its applications.

Connected Components

Finding connected components in a graph.

Topological Sort

Learn how to perform a topological sort on a directed acyclic graph.

Euler Tour

Learn about Euler tours on trees.

Dijkstra's Algorithm

Learn Dijkstra's algorithm for finding the shortest paths in a graph.

Floyd-Warshall Algorithm

Learn the Floyd-Warshall algorithm for all-pairs shortest paths.

Disjoint Set Union (DSU)

Learn about the Disjoint Set Union data structure.

Minimum Spanning Tree (MST)

Learn about Minimum Spanning Trees and algorithms to find them.

Combinatorics

An introduction to combinatorics for competitive programming.

Euler's Totient Function

Learn about Euler's totient function and its properties.

Sieve of Eratosthenes

Learn how to use the Sieve of Eratosthenes to find prime numbers efficiently.

Binary Exponentiation

Learn how to calculate powers efficiently using binary exponentiation.

Segment Tree

Learn about the Segment Tree data structure.