ID  NAME  QUALITY  USERS  ACC %  DIFFICULTY C I 

32439  Ada and Bloom  2  21 


28451  Ada and Cities  5  75 


28450  Ada and Path  5  64 


4206  Fast Maximum Matching  23  1587 


660  Dungeon of Death  12  1249 


3111  Stabards  2  148 


377  Taxi  11  1160 


26663  Theater shade in Berland  1  22 

#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)