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
4158 / 18936
21
Corruption
286 / 2050
24
Paint2D-Crack
67 / 397
56
The Butterflies
37 / 196
65
The Candies
150 / 667
96
Automat
7 / 38
99
Lines
8 / 40
100
Pareto domination
8 / 72
102
Polyhedron
3 / 18
114
Prison escape
113 / 557
150
Polygonal chain - 2
38 / 158
163
Happy figures (RU)
36 / 133
172
Swapping of data (RU)
8 / 52
173
Syntax UML (RU)
6 / 34
181
Food program (RU)
15 / 77
189
Bonding (RU)
5 / 22
190
Roads in the Kingdom (RU)
11 / 64
195
Degree (RU)
32 / 260
204
Inflation rate (RU)
10 / 80
210
Names of poems (RU)
2 / 17
211
Mushroom hunting (RU)
11 / 43
212
Fence Kopatycha (RU)
9 / 35
228
Crocodile Hunting – 2
6 / 25
251
Symmetry 2
5 / 40
253
Watermelon Fields Wonderland Countries Fools
10 / 36