| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 28451 | Ada and Cities | 3 | 47 |
|
|
| 30669 | Ada and Trip | 8 | 180 |
|
|
| 5151 | Alice’s Cube | 7 | 446 |
|
|
| 26445 | Alicias Afternoon Amble | 7 | 79 |
|
|
| 4555 | Einbahnstrasse | 445 |
|
||
| 372 | The Benefactor | 29 | 2196 |
|
|
| 4182 | Candy (Again) | 1 | 172 |
|
|
| 9126 | Time to live | 24 | 1212 |
|
|
| 3763 | George | 12 | 371 |
|
|
| 3381 | Highways | 42 | 2839 |
|
|
| 6256 | Inversion Count | 316 | 9921 |
|
|
| 4181 | MELE3 | 14 | 525 |
|
|
| 1845 | Mice and Maze | 56 | 3608 |
|
|
| 16272 | Nanoworld | 1 | 31 |
|
|
| 215 | Panic in the Plazas | 77 |
|
||
| 2047 | Stone Removing Game | -1 | 123 |
|
|
| 3405 | Almost Shortest Path | 48 | 1234 |
|
|
| 15 | The Shortest Path | 79 | 3973 |
|
|
| 26663 | Theater shade in Berland | 1 | 22 |
|
|
| 3643 | Traffic Network | 47 | 1416 |
|
|
| 1700 | Traveling by Stagecoach | 4 | 294 |
|
|
| 6294 | Yodaness Level | 48 | 2533 |
|
#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