eolymp
favoriteIf Eolymp helps you, maybe you can help Eolymp 😉 Click to make a small donation and help us keep going.

Problems

Very difficult
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...
3
Match’s model
3791 / 17532
21
Corruption
191 / 1817
24
Paint2D-Crack
64 / 342
56
The Butterflies
36 / 185
65
The Candies
135 / 583
96
Automat
7 / 30
99
Lines
8 / 36
100
Pareto domination
8 / 71
102
Polyhedron
3 / 16
114
Prison escape
106 / 518
150
Polygonal chain - 2
37 / 155
163
Happy figures (RU)
34 / 121
171
Traffic jams (RU)
6 / 20
172
Swapping of data (RU)
8 / 50
173
Syntax UML (RU)
6 / 34
181
Food program (RU)
13 / 73
189
Bonding (RU)
5 / 22
190
Roads in the Kingdom (RU)
11 / 55
195
Degree (RU)
31 / 250
204
Inflation rate (RU)
10 / 74
210
Names of poems (RU)
2 / 15
211
Mushroom hunting (RU)
11 / 41
212
Fence Kopatycha (RU)
9 / 34
227
Venusian programmers
1 / 10
228
Crocodile Hunting – 2
6 / 24