ID NAME QUALITY USERS ACC % DIFFICULTY C I
32439 Ada and Bloom   2 12
9
26
28451 Ada and Cities   4 57
12
17
28450 Ada and Path   5 54
17
30
4206 Fast Maximum Matching   16 1460
24
19
660 Dungeon of Death   11 1205
13
28
3111 Stabards   2 146
17
26
377 Taxi   12 1133
13
17
26663 Theater shade in Berland   1 22
34
17

#matching

A matching (independent edge set) on a graph is a set of edges such that no two edges share a vertex in common

https://en.wikipedia.org/wiki/Matching_(graph_theory) http://mathworld.wolfram.com/PerfectMatching.html https://en.wikipedia.org/wiki/K%C3%B6nig%27s_theorem_(graph_theory)