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
62206 / 69472
2
Digits
36663 / 45855
3
Match’s model
4650 / 21271
4
Two circles
10323 / 16801
5
Two factors
2721 / 7518
6
The vouchers
1691 / 2816
7
Roman numerals
3834 / 5586
8
Matches
5441 / 8386
9
N-digit numbers
4006 / 6079
10
Gardener
4233 / 6011
11
Big accuracy
4471 / 7710
12
Injured Picture
1033 / 1584
13
Spider and Fly
1725 / 3344
14
Rabbit-failure
2194 / 3050
15
Mouse and corns
5152 / 6648
16
Dragon
2006 / 3297
17
Gardener-painter
5145 / 6570
18
Paint2D
1040 / 2066
19
Degree of symmetry
8564 / 10147
20
How many times to repeat?
7007 / 10427
21
Corruption
511 / 2474
22
"Mirror prime" numbers
4079 / 6531
23
New-year tree
1082 / 2475
24
Paint2D-Crack
74 / 498
25
Paint3D
808 / 1221