eolymp

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
4319 / 19746
21
Corruption
358 / 2178
24
Paint2D-Crack
72 / 433
56
The Butterflies
39 / 207
65
The Candies
156 / 700
91
A Piece of Paper
5 / 44
96
Automat
8 / 43
99
Lines
9 / 46
100
Pareto domination
9 / 75
102
Polyhedron
3 / 23
114
Prison escape
123 / 580
150
Polygonal chain - 2
39 / 162
163
Happy figures (RU)
41 / 140
170
Bag of fake money
36 / 229
172
Swapping of data (RU)
9 / 53
173
Syntax UML (RU)
7 / 35
181
Food program (RU)
16 / 79
189
Bonding (RU)
6 / 23
190
Roads in the Kingdom (RU)
12 / 68
195
Degree (RU)
34 / 268
204
Inflation rate (RU)
14 / 88
210
Names of poems (RU)
4 / 20
211
Mushroom hunting (RU)
11 / 43
212
Fence Kopatycha (RU)
9 / 37
228
Crocodile Hunting – 2
6 / 27