Educational Codeforces Round 40 (Rated for Div. 2)

5 problems from Educational Codeforces Round 40 (Rated for Div. 2) (contest 954), difficulty 800-2200. 4/5 solutions verified against sample I/O.

5 items

Educational Codeforces Round 40 (Rated for Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 800-2200 | 8m 36s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Diagonal Walking	800	implementation	11,046	1m	✓
B	String Typing	1400	implementation, strings	7,789	1m 9s	✓
E	Water Taps	2000	binary-search, greedy, sortings	2,095	1m 37s
F	Runner's Problem	2100	dp, matrices, sortings	1,377	3m 11s	✓
I	Yet Another String Matching Problem	2200	fft, math	1,302	1m 39s	✓

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

CF 954F - Runner's Problem

We are given a 3 by m grid where movement is always one column to the right and can also shift vertically by at most one row. The journey starts in the middle row of the first column and must end in the same middle row at the last column.

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

CF 954I - Yet Another String Matching Problem

We are given two strings, one long string and one pattern string, both over a very small alphabet of size six. We slide the pattern across the long string, and for each position we take a substring of the same length as the pattern.

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

CF 954E - Water Taps

Each tap contributes a controllable flow of water, but every tap has a fixed temperature. You are allowed to choose a real-valued flow rate for each tap between zero and its maximum capacity.

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

CF 954B - String Typing

We are given a string that we want to construct starting from an empty string. Each action costs one operation. The basic action is appending a single character to the end of what we already have.

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

CF 954A - Diagonal Walking

We are given a sequence of moves on a grid where each move is either one step to the right or one step upward. The key operation allowed is merging a right move and an up move when they are adjacent in either order.