| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 28451 | Ada and Cities | 11 | 150 |
|
|
| 30669 | Ada and Trip | 35 | 966 |
|
|
| 5151 | Alice’s Cube | 8 | 513 |
|
|
| 26445 | Alicias Afternoon Amble | 11 | 189 |
|
|
| 4555 | Einbahnstrasse | 2 | 488 |
|
|
| 372 | The Benefactor | 48 | 3085 |
|
|
| 40642 | Chips Challenge | 1 | 23 |
|
|
| 4182 | Candy (Again) | 2 | 231 |
|
|
| 9126 | Time to live | 48 | 2047 |
|
|
| 3763 | George | 15 | 527 |
|
|
| 3381 | Highways | 77 | 4471 |
|
|
| 4181 | MELE3 | 19 | 615 |
|
|
| 1845 | Mice and Maze | 100 | 5517 |
|
|
| 16272 | Nanoworld | 1 | 39 |
|
|
| 215 | Panic in the Plazas | 84 |
|
||
| 2047 | Stone Removing Game | -1 | 133 |
|
|
| 3405 | Almost Shortest Path | 79 | 1692 |
|
|
| 15 | The Shortest Path | 157 | 7656 |
|
|
| 26663 | Theater shade in Berland | 1 | 26 |
|
|
| 3643 | Traffic Network | 89 | 2109 |
|
|
| 1700 | Traveling by Stagecoach | 9 | 472 |
|
|
| 6294 | Yodaness Level | 74 | 3563 |
|
#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