Codeforces Round 205 (Div. 2)

Solutions for Codeforces Round 205 (Div. 2) (contest 353). 2/2 problems verified against sample I/O. Difficulty range: 1200-1600.

2 items

Codeforces Round 205 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1200-1600 | Time: 5m 32s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Domino	1200	implementation, math	3m 55s	✓
C	Find Maximum	1600	implementation, math, number-theory	1m 37s	✓

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

CF 353A - Domino

We are given a row of domino tiles. Each tile has two numbers: one on the top half and one on the bottom half. We are allowed to flip a tile, which swaps its top and bottom numbers. Each flip costs one unit of time.

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

CF 353C - Find Maximum

We are given an array a of n non-negative integers, and a number m specified as a binary string. Each integer in a represents a weight associated with a position, and for any number x between 0 and m inclusive, we can select positions where the bits of x are set and sum the…