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...
103
Process simulation
17 / 37
104
Rope pulling – 2
2 / 27
105
Sets in a four-partite graph
1 / 15
106
Tokens
2 / 31
107
Compact discs
4728 / 7104
108
Median number
16734 / 19614
109
Page numbering
4157 / 5594
110
Game
1447 / 2402
111
Clocks
1682 / 2489
112
Cake
5348 / 6829
113
Balloons
3985 / 4569
114
Prison escape
123 / 581
115
Two digits
6666 / 7768
116
Long number (RU)
749 / 1308
117
Raft
1242 / 1544
118
Game - 2 (RU)
305 / 514
119
Degree of two
2132 / 2825
120
N-unit numbers - 2
347 / 622
121
CD-stock exchange
99 / 144
122
Mountain routes
1635 / 1941
123
Number of zeroes in factorial
3967 / 5120
124
Square
3659 / 5619
125
Olympiad
8893 / 10659
126
Number of an apartment
3080 / 3899
127
Dollars in bank
2981 / 3980