eolymp

Problems

Complexity
All Problems Very simple Simple Average Difficult Very difficult
Classification
All Problems ---traveling-salesman-problem- -three- 2-sat algorithms-on-strings articulation-point backtracking beginners bellman-ford-algorithm binary-search bitwise-operators breadth-first-search bridges calculation-system catalan-numbers clique combinatorics connected-components depth-first-search dijkstra-algorithm diophantine-equations Others...
11081
Electronic lock
127 / 139
11082
Similar names
2 / 7
11083
Ramsey theory
4 / 5
11084
Super lucky tickets
38 / 46
11086
Setting up communications
2 / 3
11087
Crime scene
2 / 2
11088
Shopping center
236 / 248
11089
Slurry transfusion
3 / 17
11090
Mafia game
4 / 10
11091
Japanese crossword
27 / 29
11092
Minimum string
57 / 74
11093
Xeroxinator
14 / 21
11094
Pyramid search
3 / 7
11095
Big task
3 / 6
11096
Big trampoline
2 / 8
11097
Day off
2 / 7
11099
Edit Distance Yet Again
2 / 3
11100
(Almost) Fair Cake-Cutting
2 / 2
11101
Jellyfish
2 / 2
11102
Flat Organization
2 / 2
11103
Archer Vlad
2 / 2
11104
A Very Different Word
2 / 3
11105
Cactus
2 / 2
11106
Social Distancing
2 / 2
11107
GCD vs. XOR
18 / 27