Round 3: Forest University
153 correct small sets. View problem statement or contest analysis.
Compact solutions
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Solved in...
C++ (136 sets) Java (10 sets) | Python (4 sets) Haskell (1 set) | OCaml (1 set) Pascal (1 set) |
Submission Origin
Russia (30 contestants) China (27 contestants) Japan (18 contestants) Poland (9 contestants) South Korea (8 contestants) Taiwan (7 contestants) Belarus (5 contestants) United States (4 contestants) Ukraine (4 contestants) Canada (4 contestants) Sweden (3 contestants) France (3 contestants) | Czech Republic (3 contestants) Vietnam (2 contestants) United Kingdom (2 contestants) Singapore (2 contestants) Indonesia (2 contestants) Bulgaria (2 contestants) Switzerland (1 contestant) South Africa (1 contestant) Slovakia (1 contestant) Philippines (1 contestant) Netherlands (1 contestant) Italy (1 contestant) | Iran (1 contestant) India (1 contestant) Iceland (1 contestant) Hungary (1 contestant) Hong Kong (1 contestant) Germany (1 contestant) Georgia (1 contestant) Finland (1 contestant) Brazil (1 contestant) Belgium (1 contestant) Bangladesh (1 contestant) Australia (1 contestant) |