CodeForces

Personal archive of Codeforces practice and contest submissions. This repository is where I collect accepted solutions, problem-set write-ups, and short notes on approach, complexity, and pitfalls.

Solutions are organized by standalone problems and by contest. Each folder name maps to the official problem ID on Codeforces when possible.

---

Repository layout

Path	Contents
problems/	Individual problems (practice / older AC)
contests/	Solutions grouped by rated round

---

Standalone problems (problems/)

Folder	Problem	Language	Summary
4A-watermelon	4A — Watermelon	C++	Check whether weight w can be split into two even positive parts (w > 2 and w even).
231A-team	231A — Team	C++	For each of n rounds, count how many of three friends are sure; add 1 to the answer if at least two are sure.
282A-bitplusplus	282A — Bit++	C++	Simulate n instructions X++ / X-- on a counter starting at 0.

---

Contest: Codeforces Round 1101 (Div. 2)

Contest: Codeforces Round 1101 (Div. 2)
Date: 30 May 2026
Folder: contests/round-1101-div2

Files on the desktop named Problem …, div 2 refer to this round. Local filenames are normalized below; original desktop names are listed for reference.

File	Desktop name	Problem	Lang	Idea (short)
A-convergence.cpp	Problem A, C++, div 2.cpp	2232A — Convergence	C++	Try each value as a meeting point; minimize max(left_count, right_count).
B-cake-leveling.py	Problem B, Python, div 2.py	2232B — Cake Leveling	Python	Prefix sums; at position i answer is min of prefix averages (frosting cannot flow backward).
C1-seating-arrangement-easy.py	Problem C1 (3), Python, div 2.py	2232C1 — Seating Arrangement (Easy)	Python	Greedy seating with introverts / extroverts / ambiverts under capacity x.
C2-seating-arrangement-hard.py	Problem C2 (4), Python, div 2.py	2232C2 — Seating Arrangement (Hard)	Python	Harder version of C1 (stricter constraints / larger limits).
C1C2-seating-arrangement.py	Problem C1, C2, Python, div 2.py	C1 + C2	Python	Combined attempt / shared logic for both subtasks.
D-magical-tiered-cake.py	Problem D, Python, div 2.py	2232D — Magical Tiered Cake	Python	Recursive “Tower of Hanoi”–style construction; check feasibility and emit move sequence.

Round context (personal): first rated participation — rank 380, +684 rating (684 total, newbie).

Problems E (Snaking Arrangement) and F (The Cake Is a Lie) from this round are not in the repo yet.

---

What gets added here

• Contributions: new solutions after contests or practice, with a one-line verdict when useful (e.g. AC on pretests / full AC).
• Problem sets: folders or markdown notes with statement summary, approach, time/space complexity, and links to the official problem.
• Languages: mostly C++ and Python, depending on the problem and contest.

---

How to run locally

C++ (example):

g++ -std=c++17 -O2 -o sol A-convergence.cpp
./sol < input.txt

Python:

python B-cake-leveling.py < input.txt

Use the same compiler flags / Python version you rely on on Codeforces (C++17, Py 3.x).

---

Links

• Profile: BlazejRadzik on Codeforces (update if your handle differs)
• GitHub: BlazejRadzik/CodeForces

---

License

See LICENSE. Solutions are my own work submitted in good faith for learning and portfolio purposes.