Codeforces Round 490 (Div. 3)

3 problems from Codeforces Round 490 (Div. 3) (contest 999), difficulty 800-2000. 3/3 solutions verified against sample I/O.

3 items

Codeforces Round 490 (Div. 3)

Div. 3 | 3 problems | 3/3 verified | Difficulty 800-2000 | 3m 43s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Mishka and Contest	800	brute-force, implementation	25,323	1m 20s	✓
B	Reversing Encryption	900	implementation	19,432	1m 8s	✓
E	Reachability from the Capital	2000	dfs-and-similar, graphs, greedy	7,846	1m 15s	✓

Practice › Codeforces Solutions › Codeforces Round 490 (Div. 3) ›

CF 999E - Reachability from the Capital

We are given a directed graph where cities are nodes and roads are one-way edges. One city is designated as the capital. The goal is to ensure that every city can be reached by following directed roads starting from the capital.

Practice › Codeforces Solutions › Codeforces Round 490 (Div. 3) ›

CF 999A - Mishka and Contest

We are given a list of problems arranged in a fixed order from left to right, where each problem has a difficulty value. Mishka has a skill level k, meaning he can only solve problems whose difficulty does not exceed k.

Practice › Codeforces Solutions › Codeforces Round 490 (Div. 3) ›

CF 999B - Reversing Encryption

We are given a string that has already been transformed by a deterministic process involving repeated reversals of prefixes.