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
47965 / 53585
2
Digits
27323 / 34858
3
Match’s model
3522 / 16485
4
Two circles
8450 / 13700
5
Two factors
2117 / 5700
6
The vouchers
1318 / 2084
7
Roman numerals
2992 / 4276
8
Matches
4497 / 6667
9
N-digit numbers
3212 / 4814
10
Gardener
3079 / 4218
11
Big accuracy
3833 / 6276
12
Injured Picture
819 / 1263
13
Spider and Fly
1561 / 2844
14
Rabbit-failure
1704 / 2284
15
Mouse and corns
3927 / 5178
16
Dragon
1682 / 2670
17
Gardener-painter
3780 / 4875
18
Paint2D
740 / 1550
19
Degree of symmetry
7117 / 8431
20
How many times to repeat?
5236 / 7831
21
Corruption
135 / 1680
22
"Mirror prime" numbers
2832 / 5000
23
New-year tree
817 / 1829
24
Paint2D-Crack
40 / 289
25
Paint3D
567 / 853