ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
---|---|---|---|---|---|
28451 | Ada and Cities | 9 | 104 |
|
|
28450 | Ada and Path | 7 | 80 |
|
|
17261 | Bank robbery | 2 | 235 |
|
|
10145 | Birthday Cake | 7 | 233 |
|
|
1693 | Coconuts | 12 | 663 |
|
|
3579 | Disjoint Paths | 4 | 307 |
|
|
4110 | Fast Maximum Flow | 40 | 2323 |
|
|
373 | Greedy island | 4 | 472 |
|
|
962 | Intergalactic Map | 3 | 538 |
|
|
4206 | Fast Maximum Matching | 27 | 1722 |
|
|
4485 | MobiZone vs VinaGone | 7 | 297 |
|
|
4227 | "Shortest" pair of paths | 3 | 185 |
|
|
3868 | Total Flow | 12 | 1300 |
|
|
287 | Smart Network Administrator | 3 | 410 |
|
|
203 | Potholers | 22 | 2048 |
|
|
22379 | Mobile Company 2 | 2 | 65 |
|
|
4457 | Shopping II | 3 | 132 |
|
|
377 | Taxi | 14 | 1198 |
|
#max-flow
The problem involves maximum flow problem