eolymp
bolt
Try our new interface for solving problems
Try

Problems

Complexity
All Problems Very simple Simple Average Difficult Very difficult
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...
1
Simple problem
62104 / 69358
2
Digits
36589 / 45769
3
Match’s model
4640 / 21239
4
Two circles
10314 / 16778
5
Two factors
2719 / 7508
6
The vouchers
1689 / 2808
7
Roman numerals
3826 / 5575
8
Matches
5438 / 8377
9
N-digit numbers
4001 / 6068
10
Gardener
4230 / 6004
11
Big accuracy
4465 / 7696
12
Injured Picture
1033 / 1584
13
Spider and Fly
1725 / 3341
14
Rabbit-failure
2186 / 3042
15
Mouse and corns
5142 / 6636
16
Dragon
2006 / 3288
17
Gardener-painter
5134 / 6556
18
Paint2D
1038 / 2064
19
Degree of symmetry
8545 / 10114
20
How many times to repeat?
6981 / 10390
21
Corruption
508 / 2472
22
"Mirror prime" numbers
4075 / 6526
23
New-year tree
1081 / 2472
24
Paint2D-Crack
74 / 497
25
Paint3D
804 / 1217