list of classical problems
ID | NAME | QUALITY | USERS | ACC % | DIFFICULTY C I |
---|---|---|---|---|---|
40672 | Where Proofless Assumption Fails | 4 | 65 | 41.16 |
|
40808 | Crowded Music Festival | 9 | 46 | 48.15 |
|
40945 | Internet Spamming | 4 | 22 | 29.69 |
|
40982 | Teleporters and Gems II | 4 | 34 | 19.23 |
|
41044 | Układanie kart - Card stacking | 1 | 31 | 42.22 |
|
41128 | Pierwiastkowanie | 4 | 31 | 35.85 |
|
41212 | Bankomat | 2 | 28 | 37.08 |
|
41213 | Diamond Collector | 2 | 23 | 43.10 |
|
41215 | Diamonds | 22 | 17.57 |
|
|
41374 | Digit Shifts | 1 | 13 | 7.61 |
|
41455 | .... | 1 | 11 | 15.53 |
|
41507 | GCD Product Sum | 6 | 43 | 31.33 |
|
41657 | GCD Goodness | 2 | 24 | 30.67 |
|
41790 | Spy Reloaded | 3 | 8.00 |
|
|
41823 | Martia Auris 3020 | 7 | 50.00 |
|
|
41834 | Anagrams and GCD | 10 | 8.73 |
|
|
41890 | Anagrams and Divisibility | 5 | 5.38 |
|
|
41944 | BitPlay69 | 5 | 270 | 31.50 |
|
42049 | Maximum Sum of the Array | 2 | 86 | 7.32 |
|
42340 | Bracket Check | 4 | 205 | 30.98 |
|
42487 | The 3n + 1 problem | 42 | 24.76 |
|
|
42488 | Minesweeper | 21 | 21.15 |
|
filter by
Most popular tags
#dynamic-programming (332)
#ad-hoc-1 (154)
#graph-theory (125)
#math (123)
#graph (111)
#number-theory (110)
#binary-search (101)
#tree (97)
#adhoc (92)
#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...