| ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
|---|---|---|---|---|---|
| 32439 | Ada and Bloom | 1 | 55 |
|
|
| 28451 | Ada and Cities | 10 | 142 |
|
|
| 28450 | Ada and Path | 8 | 103 |
|
|
| 4206 | Fast Maximum Matching | 30 | 1983 |
|
|
| 660 | Dungeon of Death | 14 | 1346 |
|
|
| 3111 | Stabards | 3 | 160 |
|
|
| 377 | Taxi | 14 | 1237 |
|
|
| 26663 | Theater shade in Berland | 1 | 25 |
|
#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)
RSS