Codeforces Alpha Round 20 (Codeforces format)

3 problems from Codeforces Alpha Round 20 (Codeforces format) (contest 20), difficulty 1700-2000. 3/3 solutions verified against sample I/O.

3 items

Codeforces Alpha Round 20 (Codeforces format)

Special | 3 problems | 3/3 verified | Difficulty 1700-2000 | 4m 1s

#	Problem	Rating	Tags	Accepted	Time	✓
A	BerOS file system	1700	implementation	7,125	1m 20s	✓
B	Equation	2000	math	4,796	1m 5s	✓
C	Dijkstra?	1900	graphs, shortest-paths	46,825	1m 36s	✓

Practice › Codeforces Solutions › Codeforces Alpha Round 20 (Codeforces format) ›

CF 20A - BerOS file system

We are given a filesystem path as a string. In this operating system, multiple consecutive '/' characters are treated exactly the same as a single '/'. That means paths like ///home//user///docs and /home/user/docs refer to the same location.

Practice › Codeforces Solutions › Codeforces Alpha Round 20 (Codeforces format) ›

CF 20B - Equation

We are asked to solve a quadratic equation of the form , where , , and are integers in the range . The goal is to find all real roots of the equation, count them, and print them in ascending order with high precision.

Practice › Codeforces Solutions › Codeforces Alpha Round 20 (Codeforces format) ›

CF 20C - Dijkstra?

We are given an undirected weighted graph. Every edge connects two vertices and has a positive cost. The task is to start at vertex 1, reach vertex n, and print one shortest path. If no route exists, we print -1.