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
All Problems 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 dynamic-programming euclid-extended-algorithm Others...
1
Simple problem
39907 / 44711
2
Digits
22404 / 29063
3
Match’s model
2837 / 13717
4
Two circles
7316 / 11848
5
Two factors
1878 / 4963
6
The vouchers
1125 / 1782
7
Roman numerals
2472 / 3505
8
Matches
3757 / 5650
9
N-digit numbers
2698 / 4105
10
Gardener
2577 / 3542
11
Big accuracy
3499 / 5454
12
Injured Picture
711 / 1118
13
Spider and Fly
1342 / 2475
14
Rabbit-failure
1451 / 1939
15
Mouse and corns
3372 / 4532
16
Dragon
1471 / 2323
17
Gardener-painter
3169 / 4113
18
Paint2D
665 / 1388
19
Degree of symmetry
6118 / 7315
20
How many times to repeat?
4553 / 6721
21
Corruption
97 / 1464
22
"Mirror prime" numbers
2314 / 4265
23
New-year tree
708 / 1565
24
Paint2D-Crack
38 / 246
25
Paint3D
508 / 766