Codeforces Round 194 (Div. 1)

Solutions for Codeforces Round 194 (Div. 1) (contest 333). 1/2 problems verified against sample I/O. Difficulty range: 1600-2100.

2 items

Codeforces Round 194 (Div. 1)

Type: Div. 1 | Problems: 2 | Verified: 1/2 | Rating range: 1600-2100 | Time: 3m 54s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Secrets	1600	greedy	1m 42s	✓
D	Characteristics of Rectangles	2100	binary-search, bitmasks, brute-force	2m 12s	✗

Practice › Codeforces Solutions › Codeforces Round 194 (Div. 1) ›

CF 333A - Secrets

We are asked to determine how a buyer, constrained to coins whose values are powers of three (1, 3, 9, 27, …), could pay an amount n marks in such a way that he cannot pay n exactly and must overpay using the minimum number of coins possible.

Practice › Codeforces Solutions › Codeforces Round 194 (Div. 1) ›

CF 333D - Characteristics of Rectangles

We are given a grid of integers. From this grid we may cut away some rows from the top and bottom, and some columns from the left and right. After cropping, the remaining part must still be a rectangle with at least two rows and two columns.