Educational Codeforces Round 70 (Rated for Div. 2)

6 problems from Educational Codeforces Round 70 (Rated for Div. 2) (contest 1202), difficulty 1100-2700. 3/6 solutions verified against sample I/O.

6 items

Educational Codeforces Round 70 (Rated for Div. 2)

Div. 2 | 6 problems | 3/6 verified | Difficulty 1100-2700 | 20m 35s

#	Problem	Rating	Tags	Accepted	Time	✓
A	You Are Given Two Binary Strings...	1100	bitmasks, greedy	10,718	7m 35s	✓
B	You Are Given a Decimal String...	1700	brute-force, dp, shortest-paths	4,840	5m 33s
C	You Are Given a WASD-string...	2100	brute-force, data-structures, dp	2,768	1m 37s
D	Print a 1337-string...	1900	combinatorics, constructive-algorithms, math	5,462	2m 10s
E	You Are Given Some Strings...	2400	brute-force, string-suffix-structures, strings	2,761	1m 56s	✓
F	You Are Given Some Letters...	2700	binary-search, implementation, math	542	1m 44s	✓

Practice › Codeforces Solutions › Educational Codeforces Round 70 (Rated for Div. 2) ›

CF 1202B - You Are Given a Decimal String...

We are given a long decimal string that was produced as a subsequence of outputs from a very simple counter process. The counter always starts at value zero.

Practice › Codeforces Solutions › Educational Codeforces Round 70 (Rated for Div. 2) ›

CF 1202E - You Are Given Some Strings...

We are given one long reference string t and a collection of strings s1 … sn. For every ordered pair of strings (si, sj), we form a new string by concatenating them, then we count how many times this concatenated string appears as a contiguous substring inside t.

Practice › Codeforces Solutions › Educational Codeforces Round 70 (Rated for Div. 2) ›

CF 1202D - Print a 1337-string...

We are asked to construct a string made only of the digits 1, 3, and 7 such that a very specific pattern appears a prescribed number of times as a subsequence.

Practice › Codeforces Solutions › Educational Codeforces Round 70 (Rated for Div. 2) ›

CF 1202C - You Are Given a WASD-string...

A command string describes how a robot walks on an infinite grid. Each character moves the robot one step in one of four directions. If we choose a starting position and execute the whole sequence, the robot traces a path and must never leave a finite rectangular board.

Practice › Codeforces Solutions › Educational Codeforces Round 70 (Rated for Div. 2) ›

CF 1202A - You Are Given Two Binary Strings...

We are given two binary strings, which represent two integers. One of them, call it $x$, is fixed. The other, $y$, is effectively shifted left by some number of positions $k$, then added to $x$. After computing this sum, we take its binary representation and reverse it.

Practice › Codeforces Solutions › Educational Codeforces Round 70 (Rated for Div. 2) ›

CF 1202F - You Are Given Some Letters...

We are asked to construct strings made only of two characters, say A and B, where the total number of A’s is fixed to a and the total number of B’s is fixed to b.