e-olymp
favoriteEach submission on the website costs about 0.1 UAH, last year we have processed almost 2M submissions. Click to make a small 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
44595 / 49876
2
Digits
25298 / 32445
3
Match’s model
3220 / 15295
4
Two circles
7927 / 12845
5
Two factors
1999 / 5373
6
The vouchers
1250 / 1971
7
Roman numerals
2730 / 3897
8
Matches
4172 / 6235
9
N-digit numbers
2955 / 4468
10
Gardener
2835 / 3896
11
Big accuracy
3684 / 5918
12
Injured Picture
774 / 1206
13
Spider and Fly
1467 / 2677
14
Rabbit-failure
1599 / 2140
15
Mouse and corns
3719 / 4926
16
Dragon
1604 / 2543
17
Gardener-painter
3587 / 4616
18
Paint2D
718 / 1488
19
Degree of symmetry
6757 / 8016
20
How many times to repeat?
4916 / 7330
21
Corruption
125 / 1623
22
"Mirror prime" numbers
2579 / 4644
23
New-year tree
763 / 1705
24
Paint2D-Crack
39 / 269
25
Paint3D
547 / 818