Codeforces Round 272 (Div. 1)

2 problems from Codeforces Round 272 (Div. 1) (contest 477), difficulty 2700-3100. 0/2 solutions verified against sample I/O.

2 items

Codeforces Round 272 (Div. 1)

Div. 1 | 2 problems | 0/2 verified | Difficulty 2700-3100 | 3m 11s

#	Problem	Rating	Tags	Accepted	Time	✓
D	Dreamoon and Binary	2700	dp, strings	593	1m 36s
E	Dreamoon and Notepad	3100	data-structures	160	1m 35s

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

CF 477D - Dreamoon and Binary

We are given a binary string that represents a positive integer $x$. Instead of directly printing this binary number, we are forced into a strange process that maintains a single integer variable $n$, starting at zero, and builds the output by repeatedly applying only two…

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

CF 477E - Dreamoon and Notepad

The document can be viewed as a vertical stack of rows, where each row has a fixed length and the cursor always sits at some coordinate inside this grid.