e-olymp
favorite We need a little bit of your help to keep things running, click on this banner to learn more

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
43475 / 48630
2
Digits
24867 / 31936
3
Match’s model
3178 / 15012
4
Two circles
7833 / 12666
5
Two factors
1984 / 5313
6
The vouchers
1243 / 1957
7
Roman numerals
2703 / 3842
8
Matches
4130 / 6158
9
N-digit numbers
2940 / 4429
10
Gardener
2812 / 3854
11
Big accuracy
3671 / 5862
12
Injured Picture
772 / 1197
13
Spider and Fly
1459 / 2644
14
Rabbit-failure
1593 / 2128
15
Mouse and corns
3698 / 4900
16
Dragon
1597 / 2526
17
Gardener-painter
3568 / 4590
18
Paint2D
716 / 1480
19
Degree of symmetry
6719 / 7973
20
How many times to repeat?
4880 / 7260
21
Corruption
124 / 1615
22
"Mirror prime" numbers
2553 / 4591
23
New-year tree
761 / 1691
24
Paint2D-Crack
39 / 267
25
Paint3D
546 / 814