| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 28451 | Ada and Cities | 5 | 75 |
|
|
| 30669 | Ada and Trip | 14 | 297 |
|
|
| 5151 | Alice’s Cube | 7 | 468 |
|
|
| 26445 | Alicias Afternoon Amble | 9 | 123 |
|
|
| 4555 | Einbahnstrasse | 1 | 454 |
|
|
| 372 | The Benefactor | 36 | 2419 |
|
|
| 4182 | Candy (Again) | 1 | 197 |
|
|
| 9126 | Time to live | 37 | 1520 |
|
|
| 3763 | George | 14 | 477 |
|
|
| 3381 | Highways | 50 | 3280 |
|
|
| 6256 | Inversion Count | 406 | 11462 |
|
|
| 4181 | MELE3 | 15 | 554 |
|
|
| 1845 | Mice and Maze | 65 | 4225 |
|
|
| 16272 | Nanoworld | 1 | 36 |
|
|
| 215 | Panic in the Plazas | 77 |
|
||
| 2047 | Stone Removing Game | -1 | 124 |
|
|
| 3405 | Almost Shortest Path | 63 | 1405 |
|
|
| 15 | The Shortest Path | 98 | 4745 |
|
|
| 26663 | Theater shade in Berland | 1 | 22 |
|
|
| 3643 | Traffic Network | 69 | 1636 |
|
|
| 1700 | Traveling by Stagecoach | 7 | 316 |
|
|
| 6294 | Yodaness Level | 54 | 2803 |
|
#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