Codeforces Round 237 (Div. 2)

Solutions for Codeforces Round 237 (Div. 2) (contest 404). 0/4 problems verified against sample I/O. Difficulty range: 1000-1900.

4 items

Codeforces Round 237 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 0/4 | Rating range: 1000-1900 | Time: 12m 42s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Valera and X	1000	implementation	4m 55s	✗
B	Marathon	1500	implementation, math	2m 40s	✗
C	Restore Graph	1800	dfs-and-similar, graphs, sortings	3m 31s	✗
D	Minesweeper 1D	1900	dp, implementation	1m 36s	✗

Practice › Codeforces Solutions › Codeforces Round 237 (Div. 2) ›

CF 404A - Valera and X

We are given a square grid of size $n times n$, where $n$ is an odd integer. Each cell contains a lowercase English letter. The task is to determine whether the pattern of letters forms an “X” shape under a strict rule.

Practice › Codeforces Solutions › Codeforces Round 237 (Div. 2) ›

CF 404B - Marathon

We are tracking a runner moving along the perimeter of a square of side length a, starting from the bottom-left corner (0, 0) and moving counter-clockwise. After every fixed distance d, we want to know the runner’s exact coordinates on the square boundary.

Practice › Codeforces Solutions › Codeforces Round 237 (Div. 2) ›

CF 404C - Restore Graph

We are given a sequence of distances from a single unknown root vertex in an unknown undirected simple graph. Each vertex has a known shortest-path distance to that root, and we are also told that in the original graph every vertex had degree at most k.

Practice › Codeforces Solutions › Codeforces Round 237 (Div. 2) ›

CF 404D - Minesweeper 1D

We are given a line of length $n$, where each position can either already contain a bomb, already contain a number, or be undecided. A bomb is fixed as a .