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
57141 / 63874
2
Digits
33255 / 41856
3
Match’s model
4223 / 19243
4
Two circles
9699 / 15657
5
Two factors
2504 / 6734
6
The vouchers
1537 / 2495
7
Roman numerals
3490 / 5040
8
Matches
5130 / 7698
9
N-digit numbers
3767 / 5653
10
Gardener
3746 / 5218
11
Big accuracy
4306 / 7267
12
Injured Picture
972 / 1471
13
Spider and Fly
1701 / 3152
14
Rabbit-failure
2037 / 2771
15
Mouse and corns
4823 / 6201
16
Dragon
1899 / 3039
17
Gardener-painter
4739 / 6046
18
Paint2D
939 / 1871
19
Degree of symmetry
8164 / 9640
20
How many times to repeat?
6364 / 9490
21
Corruption
327 / 2119
22
"Mirror prime" numbers
3475 / 5863
23
New-year tree
1052 / 2276
24
Paint2D-Crack
70 / 417
25
Paint3D
725 / 1068