Codeforces Round 194 (Div. 1)

5 problems from Codeforces Round 194 (Div. 1) (contest 333), difficulty 1600-2700. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 194 (Div. 1)

Div. 1 | 5 problems | 4/5 verified | Difficulty 1600-2700 | 8m 14s

# Problem Rating Tags Accepted Time ✓
A Secrets 1600 greedy 4,264 1m 43s ✓
B Chips 1800 greedy 2,762 1m 37s ✓
C Lucky Tickets 2700 brute-force, constructive-algorithms 420 1m 7s ✓
D Characteristics of Rectangles 2100 binary-search, bitmasks, brute-force 2,239 2m 6s ✓
E Summer Earnings 2500 binary-search, bitmasks, brute-force 1,249 1m 41s
Practice › Codeforces Solutions › Codeforces Round 194 (Div. 1) ›

CF 333A - Secrets

We are asked to analyze a situation with coins of denominations that are powers of three: 1, 3, 9, 27, and so on. A buyer wants to pay an exact amount n but cannot do so because he lacks the right combination of coins.
codeforces competitive-programming greedy Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 194 (Div. 1) ›

CF 333B - Chips

We are given an $n times n$ grid with some blocked cells. Gerald is allowed to place chips only on the boundary cells, but corners are forbidden starting positions.
codeforces competitive-programming greedy Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 194 (Div. 1) ›

CF 333E - Summer Earnings

We are given a set of candidate points in the plane, and we must choose exactly three of them to serve as centers of three identical circles. All three circles must have the same radius, and they are allowed to touch but not overlap in their interiors.
codeforces competitive-programming binary-search bitmasks brute-force geometry sortings Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 194 (Div. 1) ›

CF 333D - Characteristics of Rectangles

We are given a rectangular grid of numbers with $n$ rows and $m$ columns. Each cell contains a non-negative integer. The "property" of the table is defined as the minimum value among the four corner cells.
codeforces competitive-programming binary-search bitmasks brute-force implementation sortings Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 194 (Div. 1) ›

CF 333C - Lucky Tickets

We are asked to construct a large collection of 8-digit strings, where each string is a “ticket”. Each ticket is considered valid if it is possible to insert arithmetic operations between its digits and fully parenthesize the resulting expression so that the final value…
codeforces competitive-programming brute-force constructive-algorithms Jun 6, 2026