| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 28451 | Ada and Cities | 10 | 124 |
|
|
| 30669 | Ada and Trip | 31 | 650 |
|
|
| 5151 | Alice’s Cube | 7 | 493 |
|
|
| 26445 | Alicias Afternoon Amble | 11 | 179 |
|
|
| 4555 | Einbahnstrasse | 2 | 479 |
|
|
| 372 | The Benefactor | 48 | 2922 |
|
|
| 40642 | Chips Challenge | 1 | 8 |
|
|
| 4182 | Candy (Again) | 2 | 221 |
|
|
| 9126 | Time to live | 48 | 1973 |
|
|
| 3763 | George | 15 | 510 |
|
|
| 3381 | Highways | 74 | 3981 |
|
|
| 4181 | MELE3 | 18 | 591 |
|
|
| 1845 | Mice and Maze | 92 | 5067 |
|
|
| 16272 | Nanoworld | 1 | 35 |
|
|
| 215 | Panic in the Plazas | 77 |
|
||
| 2047 | Stone Removing Game | -1 | 128 |
|
|
| 3405 | Almost Shortest Path | 78 | 1605 |
|
|
| 15 | The Shortest Path | 154 | 6535 |
|
|
| 26663 | Theater shade in Berland | 1 | 22 |
|
|
| 3643 | Traffic Network | 86 | 1875 |
|
|
| 1700 | Traveling by Stagecoach | 9 | 383 |
|
|
| 6294 | Yodaness Level | 74 | 3384 |
|
#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