Level 1. Algorithmic Foundations

Algorithm complexity, implementation problems, and basic math — the foundation for everything that follows.

At this level you learn the competitive programmer's core skill — estimating a solution's speed BEFORE writing it, implementing problems carefully without losing points on details, and using basic math: divisibility, GCD and primes. The readiness criterion for level 2: you can determine your code's complexity, you know the "10⁸ operations per second" rule, and you have solved the problems of all three lessons.

In this section

  1. 1
    Algorithm Complexity and Big-O

    How to estimate an algorithm's speed before running it: Big-O notation and the 10⁸ operations per second rule.

    1 problems

  2. 2
    Implementation Problems

    Implementation problems: read the statement carefully, handle the edge cases, don't lose points on details.

    4 problems

  3. 3
    Basic Math: Divisibility, GCD, Primes

    Divisibility, GCD and LCM, primes, the sieve of Eratosthenes and prime factorization.

    3 problems

Доска