Codeforces Round 184 (Div. 2)

5 problems from Codeforces Round 184 (Div. 2) (contest 305), difficulty 1600-2300. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 184 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 1600-2300 | 7m 58s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Strange Addition	1600	brute-force, constructive-algorithms, implementation	5,222	1m 22s	✓
B	Continued Fractions	1700	brute-force, implementation, math	2,288	1m 25s	✓
C	Ivan and Powers of Two	1600	greedy, implementation	2,658	1m 48s	✓
D	Olya and Graph	2200	combinatorics, math	555	1m 36s	✓
E	Playing with String	2300	games	731	1m 47s	✓

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

CF 305A - Strange Addition

We are asked to select the largest possible subset of integers from a given set such that any two numbers in the subset can be summed by Vasya. Vasya’s summing rule is unusual: for each decimal place, at least one of the two numbers must have a zero in that place.

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

CF 305B - Continued Fractions

We are given a rational number written as a normal fraction p / q, and another number written as a finite continued fraction.

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

CF 305C - Ivan and Powers of Two

We are given a sorted array of exponents. Instead of the exponents themselves, Ivan writes the corresponding powers of two on paper: $$2^{a1}, 2^{a2}, dots, 2^{an}$$ We may add more numbers, but every added number must also be a power of two.

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

CF 305D - Olya and Graph

We are given a directed acyclic graph with vertices numbered from 1 to n, where every edge goes from a smaller-numbered vertex to a larger-numbered vertex. Some edges already exist, and we are allowed to add more edges under certain constraints.

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

CF 305E - Playing with String

We are asked to analyze a two-player string game. Players alternate moves. On a turn, a player can select any string fragment available (initially the whole string) and cut a character that is the center of a palindrome of odd length.