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...
102
Polyhedron
3 / 18
103
Process simulation
17 / 35
104
Rope pulling – 2
2 / 25
105
Sets in a four-partite graph
1 / 15
106
Tokens
2 / 30
107
Compact discs
4599 / 6881
108
Median number
16156 / 18951
109
Page numbering
3946 / 5353
110
Game
1388 / 2300
111
Clocks
1607 / 2384
112
Cake
5140 / 6589
113
Balloons
3650 / 4221
114
Prison escape
113 / 557
115
Two digits
6297 / 7362
116
Long number (RU)
694 / 1237
117
Raft
1179 / 1483
118
Game - 2 (RU)
282 / 467
119
Degree of two
2045 / 2704
120
N-unit numbers - 2
343 / 602
121
CD-stock exchange
96 / 137
122
Mountain routes
1524 / 1816
123
Number of zeroes in factorial
3650 / 4744
124
Square
3466 / 5402
125
Olympiad
8473 / 10170
126
Number of an apartment
2891 / 3655