eolymp
bolt
Try our new interface for solving problems
Try

Problems

Complexity
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...
1
Simple problem
62358 / 69643
2
Digits
36747 / 45952
3
Match’s model
4658 / 21323
4
Two circles
10344 / 16835
5
Two factors
2729 / 7542
6
The vouchers
1695 / 2821
7
Roman numerals
3842 / 5599
8
Matches
5451 / 8402
9
N-digit numbers
4013 / 6093
10
Gardener
4258 / 6045
11
Big accuracy
4491 / 7738
12
Injured Picture
1037 / 1589
13
Spider and Fly
1729 / 3354
14
Rabbit-failure
2201 / 3063
15
Mouse and corns
5177 / 6677
16
Dragon
2007 / 3303
17
Gardener-painter
5172 / 6604
18
Paint2D
1046 / 2073
19
Degree of symmetry
8571 / 10154
20
How many times to repeat?
7043 / 10471
21
Corruption
516 / 2484
22
"Mirror prime" numbers
4088 / 6542
23
New-year tree
1083 / 2480
24
Paint2D-Crack
74 / 499
25
Paint3D
812 / 1227