list of classical problems
ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
---|---|---|---|---|---|
41128 | Pierwiastkowanie | 4 | 34 | 37.61 |
|
41212 | Bankomat | 2 | 32 | 40.00 |
|
41213 | Diamond Collector | 2 | 26 | 45.16 |
|
41215 | Diamonds | 22 | 15.48 |
|
|
41374 | Digit Shifts | 1 | 13 | 7.32 |
|
41455 | .... | 1 | 11 | 14.55 |
|
41507 | GCD Product Sum | 6 | 47 | 31.42 |
|
41657 | GCD Goodness | 2 | 24 | 29.32 |
|
41790 | Spy Reloaded | 4 | 7.14 |
|
|
41823 | Martia Auris 3020 | 7 | 50.00 |
|
|
41834 | Anagrams and GCD | 10 | 7.97 |
|
|
41890 | Anagrams and Divisibility | 5 | 4.49 |
|
|
41944 | BitPlay69 | 5 | 273 | 31.64 |
|
42049 | Maximum Sum of the Array | 2 | 91 | 7.44 |
|
42340 | Bracket Check | 4 | 222 | 31.06 |
|
42487 | The 3n + 1 problem | 1 | 49 | 26.92 |
|
42488 | Minesweeper | 34 | 24.48 |
|
|
42526 | Village Unity | 3 | 50.00 |
|
|
42529 | Robert Plays The Viola | 4 | 75.00 |
|
filter by
Most popular tags
#dynamic-programming (332)
#ad-hoc-1 (154)
#graph-theory (125)
#math (123)
#number-theory (111)
#graph (111)
#binary-search (101)
#tree (97)
#adhoc (93)
#bfs (83)
#sorting (68)
#simple-math (62)
#datastructures (54)
#dfs (49)
#backtracking (44)
#bitmasks (42)
#greedy (41)
#big-numbers (40)
#basics (40)
#geometry (39)
and 430 more...