CP week 2

 This week, let’s level up:

  • Focus: More problem-solving stamina, pattern recognition, + intro to binary search, implementation, more greedy, and basic constructive algorithms.

  • Target: Solve 3–5 problems daily. Mix easy + a few moderate ones.

✅ Day 1 – Brute Force & Implementation

📘 Focus: Try multiple ways to brute force a problem.

  • CF 977B – Two-gram (String scan + counting)

  • CF 750A – New Year and Hurry (simulation, conditionals)

  • CF 486A – Calculating Function (pattern math)

  • CF 131A – cAPS LOCK (string case manipulation)

✅ Day 2 – Binary Search Intro

📘 Focus: Learn binary search on integers.

  • CF 706B – Interesting Drink (sort + lower_bound)

  • CF 977A – Wrong Subtraction (easy warm-up)

  • CF 115A – Party (trees, brute force depth)

  • CF 996A – Hit the Lottery (greedy)

✅ Day 3 – Greedy: Picking Best Steps

📘 Focus: Sort & choose steps carefully.

  • CF 935A – Fafa and his Company (divisors)

  • CF 476A – Dreamoon and Stairs (brute force range)

  • CF 271A – Beautiful Year (increment + check)

  • CF 268A – Games (nested loops, counting)

✅ Day 4 – Constructive Algorithms

📘 Focus: Problems where you must build a valid solution.

  • CF 34A – Reconnaissance 2 (adjacent pairs)

  • CF 1154A – Restoring Three Numbers (find original numbers)

  • CF 520A – Pangram (check all letters)

  • CF 723A – The New Year Meeting Friends (median)

✅ Day 5 – Frequency & Maps

📘 Focus: Practice counting elements smartly.

  • CF 268B – Buttons (sum of series)

  • CF 978B – File Name (remove characters)

  • CF 141A – Amusing Joke (anagram + frequency)

  • CF 1419A – Digit Game (greedy + parity)

✅ Day 6 – Practice + Timed Mini-Contest

📘 Focus: Simulate stress, solve 5 in one sitting (~90 mins).
Pick any mix from Days 1–5, or try:

  • CF 9A – Die Roll (fractions, gcd)

  • CF 467A – George and Accommodation (if-else)

  • CF 486A – Calculating Function (patterns)

  • CF 69A – Young Physicist (revisit)

  • CF 617A – Elephant (greedy steps)

✅ Day 7 – Review & Re-attempt

📘 Focus: Redo any failed or partially solved problems.

  • Take notes on patterns that repeat.

  • Summarize the types: brute force, math, frequency, sorting, binary search.

Comments

Post a Comment

Popular posts from this blog

Phy 129 - WM, CT-03

  Statement : For position ( x x x ) and momentum ( p p p ), the uncertainty principle is: Δ x ⋅ Δ p ≥ ℏ 2 \Delta x \cdot \Delta p \geq \frac{\hbar}{2} Δ x ⋅ Δ p ≥ 2 ℏ ​ where Δ x \Delta x Δ x is the uncertainty in position, Δ p \Delta p Δ p is the uncertainty in momentum, and ℏ ≈ 1.05 × 1 0 − 34   J \cdotp s \hbar \approx 1.05 \times 10^{-34} \, \text{J·s} ℏ ≈ 1.05 × 1 0 − 34 J \cdotp s . Similarly, for energy ( E E E ) and time ( t t t ): Δ E ⋅ Δ t ≥ ℏ 2 \Delta E \cdot \Delta t \geq \frac{\hbar}{2} Δ E ⋅ Δ t ≥ 2 ℏ ​ . #Learning -2 p = γ m v p = \gamma m v p = γm v , where: m m m is the rest mass of the particle, v v v is the velocity of the particle, γ \gamma γ is the Lorentz factor, given by γ = 1 1 − v 2 c 2 \gamma = \frac{1}{\sqrt{1 - \frac{v^2}{c^2}}} ; A wave group: a wave group corresponds to a moving particle and is formed by the superposition of multiple harmonic waves with different frequencies, wave numbers, and amplitudes.\ Wave Function Ψ ( x ) \Psi(x)...
Read more
Copy of Jujutsu Kaisen 2D Game UI Design Request                                                                                                                                                                ...
Read more

Online 3 CSE 102; Array Resources.

 Problems and their solution: Practice Problems on “Array” (MOODLE) Problem 1: Floor, Ceil within an array              A[] = {96, 21, 58, 34, 46} Number Floor Ceil 15 -1 21 21 21 21 30 21 34 96 96 96 98 96 -1 Solution: Sort them, then find floor and ceil from the array. Use selection sort: void selectionSort(int arr[], int n) {     int i, j, minIndex, temp;     for (i = 0; i < n - 1; i++) {         minIndex = i;         // Find the index of the smallest element in the remaining array         for (j = i + 1; j < n; j++) {             if (arr[j] < arr[minIndex])                 minIndex = j;         }         // Swap the found minimum element with the first element         if (minIndex != i) {    ...
Read more