Round 2: The Gardener of Seville
367 correct small sets and 70 correct large sets. View problem statement or contest analysis.
Compact solutions
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Solved in...
C++ (333 sets) Java (43 sets) Python (35 sets) C# (12 sets) | OCaml (3 sets) Scala (3 sets) JavaScript (2 sets) Ruby (2 sets) | C (1 set) Go (1 set) |
Submission Origin
China (69 contestants) Russia (58 contestants) Japan (49 contestants) South Korea (21 contestants) United States (20 contestants) Taiwan (14 contestants) Poland (13 contestants) Ukraine (11 contestants) Netherlands (7 contestants) Hong Kong (7 contestants) France (7 contestants) Canada (7 contestants) Australia (7 contestants) Iran (5 contestants) Belarus (5 contestants) Vietnam (4 contestants) Hungary (4 contestants) | Brazil (4 contestants) Thailand (3 contestants) Slovakia (3 contestants) Romania (3 contestants) Lithuania (3 contestants) Latvia (3 contestants) Indonesia (3 contestants) Finland (3 contestants) Croatia (3 contestants) United Kingdom (2 contestants) Sweden (2 contestants) South Africa (2 contestants) Singapore (2 contestants) Italy (2 contestants) Czech Republic (2 contestants) Bulgaria (2 contestants) Argentina (2 contestants) | Turkey (1 contestant) Switzerland (1 contestant) Spain (1 contestant) Slovenia (1 contestant) Serbia (1 contestant) Philippines (1 contestant) Norway (1 contestant) Kyrgyzstan (1 contestant) Israel (1 contestant) India (1 contestant) Iceland (1 contestant) Greece (1 contestant) Germany (1 contestant) Egypt (1 contestant) Austria (1 contestant) |