eolymp
favoriteA small monthly contribution from 1% of our users can make the website run forever. Click to make a donation and help us keep going.

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
52017 / 58080
2
Digits
29645 / 37556
3
Match’s model
3811 / 17622
4
Two circles
8935 / 14450
5
Two factors
2292 / 6090
6
The vouchers
1427 / 2260
7
Roman numerals
3200 / 4574
8
Matches
4712 / 7025
9
N-digit numbers
3441 / 5155
10
Gardener
3309 / 4546
11
Big accuracy
4036 / 6686
12
Injured Picture
890 / 1347
13
Spider and Fly
1622 / 2968
14
Rabbit-failure
1848 / 2462
15
Mouse and corns
4283 / 5559
16
Dragon
1793 / 2844
17
Gardener-painter
4155 / 5329
18
Paint2D
826 / 1701
19
Degree of symmetry
7540 / 8908
20
How many times to repeat?
5626 / 8423
21
Corruption
192 / 1820
22
"Mirror prime" numbers
3034 / 5291
23
New-year tree
937 / 2021
24
Paint2D-Crack
65 / 343
25
Paint3D
642 / 945