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 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
40036 / 44857
2
Digits
22515 / 29206
3
Match’s model
2851 / 13771
4
Two circles
7346 / 11888
5
Two factors
1884 / 4981
6
The vouchers
1133 / 1791
7
Roman numerals
2479 / 3520
8
Matches
3775 / 5673
9
N-digit numbers
2708 / 4117
10
Gardener
2590 / 3556
11
Big accuracy
3504 / 5465
12
Injured Picture
715 / 1123
13
Spider and Fly
1348 / 2484
14
Rabbit-failure
1455 / 1942
15
Mouse and corns
3385 / 4544
16
Dragon
1477 / 2330
17
Gardener-painter
3175 / 4120
18
Paint2D
667 / 1391
19
Degree of symmetry
6136 / 7334
20
How many times to repeat?
4571 / 6748
21
Corruption
97 / 1471
22
"Mirror prime" numbers
2324 / 4274
23
New-year tree
710 / 1566
24
Paint2D-Crack
39 / 248
25
Paint3D
511 / 768