Codeforces Round 640 (Div. 4)

3 problems from Codeforces Round 640 (Div. 4) (contest 1352), difficulty 800-1500. 0/3 solutions verified against sample I/O.

3 items

Codeforces Round 640 (Div. 4)

Div. 4 | 3 problems | 0/3 verified | Difficulty 800-1500 | 29m 36s

#	Problem	Rating	Tags	Accepted	Time
A	Sum of Round Numbers	800	implementation, math	104,056	6m 16s
B	Same Parity Summands	1200	constructive-algorithms, math	44,806	6m 28s
F	Binary String Reconstruction	1500	constructive-algorithms, dfs-and-similar, math	19,400	16m 52s

Practice › Codeforces Solutions › Codeforces Round 640 (Div. 4) ›

CF 1352B - Same Parity Summands

We are asked to split a given integer $n$ into exactly $k$ positive parts such that all parts share the same parity. This means we must choose either all odd numbers or all even numbers, and these $k$ numbers must sum exactly to $n$.

Practice › Codeforces Solutions › Codeforces Round 640 (Div. 4) ›

CF 1352A - Sum of Round Numbers

The task is about breaking a given integer into simpler building blocks, where each building block is a number that looks like a single non-zero digit followed only by zeros. These are numbers such as 7, 40, 900, or 3000.

Practice › Codeforces Solutions › Codeforces Round 640 (Div. 4) ›

CF 1352F - Binary String Reconstruction

We are asked to reconstruct a binary string given the counts of its consecutive pairs grouped by how many ones they contain.