Level 1 CP Training – Menofia ICPC

Level 1 Training Plan

This program builds on your foundation with core algorithms, data structures, and number theory. By the end, you'll be ready to confidently solve Div2 A, B, and C problems.

0
Newcomer
1
Level 1
2
Level 2
3
Senior

Week 0 General Prep & Revision

  • Solving a general problem sheet to warm up and identify strengths.
  • Coaches: Mordy, Eslam, Ameen Osama.

Week 1 Linear STL & Sorting

  • STL Containers: vector, pair, queue, deque, stack.
  • Library Sorting & Custom Comparators.

Week 2 Nonlinear STL

  • STL Containers: map, set, priority_queue, multiset.
  • Sorting with lower/upper bound.
  • 3-hour STL contest.

Week 3 Greedy & Ad-hoc Problems

  • Introduction to Greedy algorithms and Ad-hoc problem-solving techniques.
  • Applications: Sweep Line, Scheduling, Tasks and Deadlines.
  • 3-hour contest.

Week 4 Prefix Sum & Frequency Techniques

  • 1D & 2D Prefix Sums, Partial Sums.
  • Frequency Arrays.
  • Prefix/Suffix with min, max, gcd, lcm.
  • 3-hour contest.

Week 5 Number Theory Basics

  • Prime Numbers, Prime Factorization, and Sieve of Eratosthenes.
  • Calculating divisors and their properties.
  • 3-hour contest.

Week 6 Bitwise Operations

  • Bitwise Operators: AND, OR, XOR, NOT, Left/Right Shift.
  • Applications: Parity checks, counting set bits, and manipulating bits.
  • 3-hour contest.

Week 7 Bitmasking

  • Introduction to Bitmasking for subsets and state representation.
  • Complete Search with Bitmasking.
  • 3-hour contest.

Week 8 Constructive Algorithms

  • Developing constructive thinking for building solutions.
  • Problems involving permutations and array construction.
  • 3-hour contest.

Week 9 GCD, LCM & Divisibility

  • Euclidean Algorithm for GCD.
  • Properties of Divisibility and their applications.
  • 3-hour contest.

Week 10 Modular Arithmetic

  • Modular properties, Binary Exponentiation, and Modular Inverse.
  • Fermat's Little Theorem and Extended Euclidean Algorithm.
  • 3-hour contest.

Week 11 Binary Search

  • Binary Search on a monotonic function.
  • Binary Search on the Answer (Discrete & Continuous).
  • 3-hour contest.

Week 12 Two Pointers & Sliding Window

  • The Two Pointers technique for linear traversals.
  • Sliding Window patterns for subarray/substring problems.
  • 3-hour contest.