ID NAME QUALITY USERS ACC % DIFFICULTY C I
28451 Ada and Cities   10 124
19
17
28450 Ada and Path   7 88
15
28
17261 Bank robbery   3 236
17
21
10145 Birthday Cake   7 241
12
12
1693 Coconuts   13 728
21
28
3579 Disjoint Paths   4 308
24
27
4110 Fast Maximum Flow   45 2554
26
21
373 Greedy island   5 488
26
26
962 Intergalactic Map   2 541
19
28
4206 Fast Maximum Matching   30 1832
22
19
4485 MobiZone vs VinaGone   7 311
17
31
4227 "Shortest" pair of paths   3 189
23
17
3868 Total Flow   12 1328
14
12
287 Smart Network Administrator   3 416
24
31
203 Potholers   22 2177
16
12
22379 Mobile Company 2   2 66
13
17
4457 Shopping II   3 140
17
1
377 Taxi   14 1212
13
16

#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