ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
---|---|---|---|---|---|
28451 | Ada and Cities | 11 | 147 |
|
|
28450 | Ada and Path | 9 | 105 |
|
|
17261 | Bank robbery | 3 | 249 |
|
|
10145 | Birthday Cake | 7 | 258 |
|
|
1693 | Coconuts | 13 | 961 |
|
|
3579 | Disjoint Paths | 4 | 313 |
|
|
4110 | Fast Maximum Flow | 48 | 2958 |
|
|
373 | Greedy island | 6 | 514 |
|
|
962 | Intergalactic Map | 2 | 566 |
|
|
4206 | Fast Maximum Matching | 32 | 2040 |
|
|
4485 | MobiZone vs VinaGone | 7 | 331 |
|
|
4227 | "Shortest" pair of paths | 3 | 213 |
|
|
3868 | Total Flow | 11 | 1394 |
|
|
287 | Smart Network Administrator | 3 | 454 |
|
|
203 | Potholers | 22 | 2274 |
|
|
22379 | Mobile Company 2 | 3 | 71 |
|
|
4457 | Shopping II | 3 | 148 |
|
|
377 | Taxi | 14 | 1242 |
|
#max-flow
The problem involves maximum flow problem