Round 2: A Digging Problem
193 correct small sets and 70 correct large sets. View problem statement or contest analysis.
Compact solutions
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Solved in...
C++ (186 sets) Java (40 sets) C# (15 sets) | Python (12 sets) C (4 sets) Haskell (3 sets) | OCaml (1 set) Pascal (1 set) Scala (1 set) |
Submission Origin
Russia (36 contestants) United States (26 contestants) China (16 contestants) Japan (15 contestants) Poland (10 contestants) Ukraine (9 contestants) Bulgaria (6 contestants) Belarus (6 contestants) United Kingdom (5 contestants) South Korea (5 contestants) Netherlands (5 contestants) Brazil (5 contestants) Germany (4 contestants) | Sweden (3 contestants) Portugal (3 contestants) Latvia (3 contestants) Hong Kong (3 contestants) Finland (3 contestants) Croatia (3 contestants) Venezuela (2 contestants) Slovakia (2 contestants) Singapore (2 contestants) Lithuania (2 contestants) France (2 contestants) Egypt (2 contestants) Canada (2 contestants) | Austria (2 contestants) Switzerland (1 contestant) Spain (1 contestant) Romania (1 contestant) Kazakhstan (1 contestant) Italy (1 contestant) Israel (1 contestant) Indonesia (1 contestant) India (1 contestant) Hungary (1 contestant) Denmark (1 contestant) Belgium (1 contestant) |