eolymp
favoriteWe need a little bit of your help to keep things running, click on this banner 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
46922 / 52420
2
Digits
26655 / 34028
3
Match’s model
3403 / 16023
4
Two circles
8237 / 13342
5
Two factors
2058 / 5542
6
The vouchers
1286 / 2033
7
Roman numerals
2856 / 4073
8
Matches
4349 / 6477
9
N-digit numbers
3134 / 4697
10
Gardener
2988 / 4094
11
Big accuracy
3772 / 6130
12
Injured Picture
800 / 1240
13
Spider and Fly
1524 / 2772
14
Rabbit-failure
1663 / 2226
15
Mouse and corns
3797 / 5023
16
Dragon
1642 / 2612
17
Gardener-painter
3675 / 4740
18
Paint2D
729 / 1522
19
Degree of symmetry
6959 / 8247
20
How many times to repeat?
5124 / 7651
21
Corruption
131 / 1651
22
"Mirror prime" numbers
2703 / 4834
23
New-year tree
788 / 1763
24
Paint2D-Crack
39 / 279
25
Paint3D
556 / 837