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
53694 / 59985
2
Digits
30970 / 39083
3
Match’s model
3965 / 18123
4
Two circles
9186 / 14822
5
Two factors
2337 / 6264
6
The vouchers
1469 / 2328
7
Roman numerals
3279 / 4700
8
Matches
4893 / 7306
9
N-digit numbers
3579 / 5334
10
Gardener
3439 / 4735
11
Big accuracy
4123 / 6865
12
Injured Picture
907 / 1368
13
Spider and Fly
1649 / 3010
14
Rabbit-failure
1893 / 2525
15
Mouse and corns
4439 / 5731
16
Dragon
1819 / 2893
17
Gardener-painter
4281 / 5494
18
Paint2D
841 / 1731
19
Degree of symmetry
7694 / 9075
20
How many times to repeat?
5781 / 8645
21
Corruption
203 / 1861
22
"Mirror prime" numbers
3145 / 5428
23
New-year tree
975 / 2091
24
Paint2D-Crack
65 / 348
25
Paint3D
653 / 960