Codeforces Round 180 (Div. 1)

Solutions for Codeforces Round 180 (Div. 1) (contest 297). 2/3 problems verified against sample I/O. Difficulty range: 1600-3000.

3 items

Codeforces Round 180 (Div. 1)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Parity Game	1700	constructive-algorithms	1m 14s	✓
B	Fish Weight	1600	constructive-algorithms, greedy	1m 2s	✓
E	Mystic Carvings	3000	data-structures	1m 47s	✗

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

CF 297A - Parity Game

We are given two binary strings, a and b. Our task is to transform a into b using only two operations. The first operation appends the parity of the current string a to its end, where parity is 1 if the number of 1s in a is odd, and 0 if even.

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

CF 297B - Fish Weight

We are given two people, Alice and Bob, each of whom has caught a collection of fish. Every fish belongs to one of k species, and species numbers are ordered so that species with a larger index are guaranteed to be at least as heavy as those with a smaller index.

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

CF 297E - Mystic Carvings

We are given a circle with $2n$ labeled points arranged in order. These points are connected pairwise by $n$ chords, and each point is used exactly once, so the chords form a perfect matching on the circle. From these endpoints, we must choose exactly three of the given chords.