Educational Codeforces Round 70 (Rated for Div. 2)

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

5 items

Educational Codeforces Round 70 (Rated for Div. 2)

Div. 2 | 5 problems | 2/5 verified | Difficulty 1100-2700 | 24m 7s

#	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	3m 13s
C	You Are Given a WASD-string...	2100	brute-force, data-structures, dp	2,768	5m 48s
D	Print a 1337-string...	1900	combinatorics, constructive-algorithms, math	5,462	5m 47s
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 1202C - You Are Given a WASD-string...

A robot follows a sequence of movement commands on an infinite grid. Each character in the string describes a unit move in one of four directions, so the string encodes a walk on the integer lattice.

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 characters 1, 3, and 7. For each query, we must build such a string so that the number of subsequences equal to the pattern 1337 is exactly equal to a given integer n.

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

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

We are given a decimal string that represents a subsequence of some hidden process. That hidden process starts from value zero and repeatedly does two things: it outputs the last digit of the current value, then increases the value by either a fixed step x or a fixed step y…

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.