Codeforces Round 121 (Div. 2)

2 problems from Codeforces Round 121 (Div. 2) (contest 192), difficulty 1100-1300. 0/2 solutions verified against sample I/O.

2 items

Codeforces Round 121 (Div. 2)

Div. 2 | 2 problems | 0/2 verified | Difficulty 1100-1300 | 3m 47s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Funky Numbers	1300	binary-search, brute-force, implementation	11,565	47s
B	Walking in the Rain	1100	brute-force, implementation	6,799	3m

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

CF 192A - Funky Numbers

This is a Type A - “Find all X” problem. A valid proof must do two things: 1. Verify that every claimed solution actually satisfies the conditions. 2. Prove that no other solutions exist. The proposed solution does not complete either direction fully.

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

CF 192B - Walking in the Rain

We are asked to determine the number of days the opposition can walk along a boulevard of tiles before it becomes impossible due to the tiles being destroyed by rain. Each tile has a durability measured in days.