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
59778 / 66802
2
Digits
34912 / 43773
3
Match’s model
4420 / 20222
4
Two circles
9951 / 16100
5
Two factors
2534 / 7045
6
The vouchers
1587 / 2604
7
Roman numerals
3591 / 5224
8
Matches
5197 / 7960
9
N-digit numbers
3830 / 5776
10
Gardener
3981 / 5622
11
Big accuracy
4348 / 7419
12
Injured Picture
972 / 1488
13
Spider and Fly
1684 / 3211
14
Rabbit-failure
2095 / 2894
15
Mouse and corns
4865 / 6241
16
Dragon
1930 / 3144
17
Gardener-painter
4817 / 6150
18
Paint2D
969 / 1929
19
Degree of symmetry
8304 / 9816
20
How many times to repeat?
6546 / 9783
21
Corruption
379 / 2228
22
"Mirror prime" numbers
3747 / 6087
23
New-year tree
1043 / 2316
24
Paint2D-Crack
73 / 447
25
Paint3D
745 / 1124