eolymp
favoriteA small monthly contribution from 1% of our users can make the website run forever. Click to make a donation and help us keep going.

Problems

Very difficult
All Problems Very simple Simple Average Difficult Very difficult
Classification
All Problems ---topological-sort- ---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 Others...
3
Match’s model
3410 / 16053
24
Paint2D-Crack
39 / 280
56
The Butterflies
35 / 171
65
The Candies
126 / 534
74
Spider and Fly - 2
83 / 370
96
Automat
7 / 28
99
Lines
8 / 34
100
Pareto domination
7 / 68
102
Polyhedron
3 / 16
114
Prison escape
101 / 496
150
Polygonal chain - 2
30 / 128
163
Happy figures (RU)
30 / 111
164
Postcards (RU)
2 / 20
171
Traffic jams (RU)
5 / 19
172
Swapping of data (RU)
8 / 49
173
Syntax UML (RU)
6 / 30
181
Food program (RU)
12 / 71
189
Bonding (RU)
3 / 19
190
Roads in the Kingdom (RU)
10 / 51
195
Degree (RU)
27 / 232
204
Inflation rate (RU)
10 / 68
210
Names of poems (RU)
2 / 15
211
Mushroom hunting (RU)
11 / 40
227
Venusian programmers
1 / 8
228
Crocodile Hunting – 2
6 / 23