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
59084 / 66052
2
Digits
34118 / 42864
3
Match’s model
4317 / 19723
4
Two circles
9849 / 15927
5
Two factors
2544 / 6886
6
The vouchers
1571 / 2557
7
Roman numerals
3559 / 5138
8
Matches
5198 / 7829
9
N-digit numbers
3829 / 5759
10
Gardener
3820 / 5353
11
Big accuracy
4367 / 7387
12
Injured Picture
982 / 1490
13
Spider and Fly
1719 / 3210
14
Rabbit-failure
2078 / 2841
15
Mouse and corns
4885 / 6281
16
Dragon
1920 / 3079
17
Gardener-painter
4836 / 6167
18
Paint2D
950 / 1896
19
Degree of symmetry
8233 / 9731
20
How many times to repeat?
6493 / 9665
21
Corruption
357 / 2176
22
"Mirror prime" numbers
3593 / 6013
23
New-year tree
1061 / 2306
24
Paint2D-Crack
72 / 433
25
Paint3D
739 / 1094