Codeforces Round 473 (Div. 2)

3 problems from Codeforces Round 473 (Div. 2) (contest 959), difficulty 800-1900. 3/3 solutions verified against sample I/O.

3 items

Codeforces Round 473 (Div. 2)

Div. 2 | 3 problems | 3/3 verified | Difficulty 800-1900 | 4m 23s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Mahmoud and Ehab and the even-odd game	800	games, math	55,647	58s	✓
C	Mahmoud and Ehab and the wrong algorithm	1500	constructive-algorithms, trees	6,207	1m 13s	✓
E	Mahmoud and Ehab and the xor-MST	1900	bitmasks, dp, graphs	3,765	2m 12s	✓

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

CF 959E - Mahmoud and Ehab and the xor-MST

We are given a complete graph on vertices labeled from 0 to n − 1. Every pair of distinct vertices is connected, and the weight of the edge between u and v is the bitwise XOR of their labels.

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

CF 959C - Mahmoud and Ehab and the wrong algorithm

We are given a tree with n vertices and asked to construct two different trees on the same number of vertices, each meant to expose the failure or correctness of a specific heuristic for minimum vertex cover. The heuristic is extremely simple.

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

CF 959A - Mahmoud and Ehab and the even-odd game

The game starts with a single integer value, and two players alternately reduce it. On Mahmoud’s turn, he is only allowed to subtract an even positive number that does not exceed the current value.