eolymp
favoriteDid you know that Eolymp is maintained by a non-profit organization? We do not receive any profit and provide our services free of charge to everyone. Click to learn more.

Problems

Complexity
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...
1
Simple problem
49907 / 55755
2
Digits
28789 / 36569
3
Match’s model
3705 / 17132
4
Two circles
8770 / 14198
5
Two factors
2243 / 5956
6
The vouchers
1402 / 2215
7
Roman numerals
3125 / 4459
8
Matches
4615 / 6866
9
N-digit numbers
3365 / 5043
10
Gardener
3236 / 4440
11
Big accuracy
3969 / 6545
12
Injured Picture
882 / 1335
13
Spider and Fly
1602 / 2920
14
Rabbit-failure
1795 / 2405
15
Mouse and corns
4198 / 5464
16
Dragon
1766 / 2797
17
Gardener-painter
4023 / 5174
18
Paint2D
807 / 1662
19
Degree of symmetry
7418 / 8765
20
How many times to repeat?
5507 / 8236
21
Corruption
171 / 1780
22
"Mirror prime" numbers
2946 / 5167
23
New-year tree
930 / 1991
24
Paint2D-Crack
60 / 332
25
Paint3D
634 / 934