| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 28451 | Ada and Cities | 11 | 153 |
|
|
| 30669 | Ada and Trip | 35 | 983 |
|
|
| 5151 | Alice’s Cube | 8 | 516 |
|
|
| 26445 | Alicias Afternoon Amble | 11 | 189 |
|
|
| 4555 | Einbahnstrasse | 2 | 489 |
|
|
| 372 | The Benefactor | 49 | 3097 |
|
|
| 40642 | Chips Challenge | 1 | 28 |
|
|
| 4182 | Candy (Again) | 2 | 236 |
|
|
| 9126 | Time to live | 48 | 2058 |
|
|
| 3763 | George | 15 | 528 |
|
|
| 3381 | Highways | 77 | 4506 |
|
|
| 4181 | MELE3 | 19 | 615 |
|
|
| 1845 | Mice and Maze | 100 | 5559 |
|
|
| 16272 | Nanoworld | 1 | 42 |
|
|
| 215 | Panic in the Plazas | 89 |
|
||
| 2047 | Stone Removing Game | -1 | 132 |
|
|
| 3405 | Almost Shortest Path | 79 | 1708 |
|
|
| 15 | The Shortest Path | 158 | 7699 |
|
|
| 26663 | Theater shade in Berland | 1 | 28 |
|
|
| 3643 | Traffic Network | 89 | 2115 |
|
|
| 1700 | Traveling by Stagecoach | 9 | 476 |
|
|
| 6294 | Yodaness Level | 74 | 3571 |
|
#shortest-path
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.
https://en.wikipedia.org/wiki/Shortest_path_problem https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
RSS