eolymp

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
56099 / 62701
2
Digits
32478 / 40936
3
Match’s model
4158 / 18936
4
Two circles
9489 / 15352
5
Two factors
2424 / 6547
6
The vouchers
1512 / 2444
7
Roman numerals
3411 / 4903
8
Matches
5063 / 7591
9
N-digit numbers
3713 / 5562
10
Gardener
3606 / 5024
11
Big accuracy
4251 / 7151
12
Injured Picture
939 / 1420
13
Spider and Fly
1685 / 3111
14
Rabbit-failure
1954 / 2650
15
Mouse and corns
4647 / 5977
16
Dragon
1874 / 2995
17
Gardener-painter
4588 / 5862
18
Paint2D
912 / 1833
19
Degree of symmetry
7959 / 9393
20
How many times to repeat?
6152 / 9217
21
Corruption
286 / 2050
22
"Mirror prime" numbers
3350 / 5708
23
New-year tree
1015 / 2211
24
Paint2D-Crack
67 / 397
25
Paint3D
703 / 1031