ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   4 57
12
17
28450 Ada and Path   5 52
17
30
17261 Bank robbery   2 182
17
23
10145 Birthday Cake   7 197
16
14
1693 Coconuts   8 591
22
29
3579 Disjoint Paths   2 286
23
34
4110 Fast Maximum Flow   28 1925
24
21
373 Greedy island   2 415
30
27
962 Intergalactic Map   3 501
22
29
4206 Fast Maximum Matching   15 1449
24
19
4485 MobiZone vs VinaGone   4 238
21
34
4227 "Shortest" pair of paths   3 174
23
17
3868 Total Flow   8 1208
12
12
287 Smart Network Administrator   3 382
24
31
203 Potholers   19 1819
16
14
22379 Mobile Company 2   1 52
12
17
4457 Shopping II   2 118
17
1
377 Taxi   12 1130
13
17

#max-flow

The problem involves maximum flow problem

https://en.wikipedia.org/wiki/Maximum_flow_problem http://www.cs.princeton.edu/courses/archive/spr04/cos226/lectures/maxflow.4up.pdf