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 ---topological-sort- ---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 Others...
1
Simple problem
50473 / 56363
2
Digits
29170 / 36977
3
Match’s model
3757 / 17352
4
Two circles
8848 / 14318
5
Two factors
2263 / 6011
6
The vouchers
1411 / 2233
7
Roman numerals
3166 / 4517
8
Matches
4662 / 6938
9
N-digit numbers
3396 / 5100
10
Gardener
3278 / 4493
11
Big accuracy
4004 / 6615
12
Injured Picture
887 / 1339
13
Spider and Fly
1607 / 2933
14
Rabbit-failure
1828 / 2440
15
Mouse and corns
4245 / 5516
16
Dragon
1781 / 2818
17
Gardener-painter
4109 / 5270
18
Paint2D
819 / 1690
19
Degree of symmetry
7488 / 8845
20
How many times to repeat?
5561 / 8319
21
Corruption
179 / 1804
22
"Mirror prime" numbers
2987 / 5221
23
New-year tree
933 / 2008
24
Paint2D-Crack
63 / 337
25
Paint3D
638 / 940