Codeforces Round 145 (Div. 2, ACM-ICPC Rules)

Solutions for Codeforces Round 145 (Div. 2, ACM-ICPC Rules) (contest 234). 2/5 problems verified against sample I/O. Difficulty range: 1000-2000.

5 items

Codeforces Round 145 (Div. 2, ACM-ICPC Rules)

Type: Div. 2 | Problems: 5 | Verified: 2/5 | Rating range: 1000-2000 | Time: 9m 42s

Problem Name Rating Tags Solve Time Verified
B Reading 1000 sortings 1m 19s ✓
C Weather 1300 dp, implementation 1m 27s ✓
F Fence 1800 dp 1m 5s ✗
G Practice 1600 constructive-algorithms, divide-and-conquer, implementation 2m 54s ✗
H Merging Two Decks 2000 constructive-algorithms, greedy 2m 57s ✗
Practice › Codeforces Solutions › Codeforces Round 145 (Div. 2, ACM-ICPC Rules) ›

CF 234B - Reading

We are given a sequence of hours on a train journey, each with an associated light level between 0 and 100. Vasya wants to read for exactly k of these hours.
codeforces competitive-programming sortings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 145 (Div. 2, ACM-ICPC Rules) ›

CF 234C - Weather

We are given an array of daily temperatures. We want the sequence to look like this: First, several consecutive negative values. Then, several consecutive positive values. Both parts must be non-empty, and zero is forbidden anywhere in the final sequence.
codeforces competitive-programming dp implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 145 (Div. 2, ACM-ICPC Rules) ›

CF 234F - Fence

This is a Type B - “Prove that” problem. The statement to prove is: If $$a+b=tanfrac{gamma}{2}(atanalpha+btanbeta),$$ then the triangle is isosceles. The proposed proof attempts exactly this implication. It does not merely prove a weaker statement.
codeforces competitive-programming dp May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 145 (Div. 2, ACM-ICPC Rules) ›

CF 234G - Practice

We are given a team of n football players, each with a unique number from 1 to n. The coach wants to organize practice games so that every pair of players has faced each other on opposing teams at least once.
codeforces competitive-programming constructive-algorithms divide-and-conquer implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 145 (Div. 2, ACM-ICPC Rules) ›

CF 234H - Merging Two Decks

We are given two stacks of cards, each card either face up or face down. The goal is to merge the decks into a single stack in a way that preserves the relative order of cards within each original deck, and then perform a series of operations to turn all cards face down using…
codeforces competitive-programming constructive-algorithms greedy May 29, 2026