Codeforces Round 132 (Div. 2)

Solutions for Codeforces Round 132 (Div. 2) (contest 215). 4/5 problems verified against sample I/O. Difficulty range: 900-2100.

5 items

Codeforces Round 132 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 900-2100 | Time: 8m 51s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Bicycle Chain	900	brute-force, implementation	1m 25s	✓
B	Olympic Medal	1300	greedy, math	1m 43s	✓
C	Crosses	2100	brute-force, implementation	1m 39s	✓
D	Hot Days	1900	greedy	1m 6s	✓
E	Periodical Numbers	2100	combinatorics, dp, number-theory	2m 58s	✗

Practice › Codeforces Solutions › Codeforces Round 132 (Div. 2) ›

CF 215A - Bicycle Chain

We have two sets of bicycle gears. The front gears are attached to the pedals, and the rear gears are attached to the back wheel. If the chain connects front gear a[i] to rear gear b[j], the resulting gear ratio is b[j] / a[i].

Practice › Codeforces Solutions › Codeforces Round 132 (Div. 2) ›

CF 215B - Olympic Medal

We are designing a two-part medal. The outer part is a ring with outer radius $r1$ and inner radius $r2$. The inner part is a solid disk of radius $r2$. Both parts have the same thickness, so their masses depend only on area and density.

Practice › Codeforces Solutions › Codeforces Round 132 (Div. 2) ›

CF 215C - Crosses

Each cross is defined by two axis-aligned rectangles centered at the same cell (x0, y0). The first rectangle extends a cells vertically and b cells horizontally from the center, so its size is: $(2a+1)(2b+1)$ The second rectangle is defined similarly using c and d.

Practice › Codeforces Solutions › Codeforces Round 132 (Div. 2) ›

CF 215D - Hot Days

We are asked to transport a group of schoolchildren through a sequence of regions along a single road. Each region has a fixed outdoor temperature and a maximum tolerable bus temperature. Every child inside a bus above that tolerable temperature triggers a monetary penalty.

Practice › Codeforces Solutions › Codeforces Round 132 (Div. 2) ›

CF 215E - Periodical Numbers

We are asked to count numbers in a given range [l, r] whose binary representations are periodic. A number is periodic if its binary string has a repeating pattern of length k that divides the total length n of the string, meaning every segment of length k repeats exactly…