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
42765 / 47853
2
Digits
24386 / 31351
3
Match’s model
3090 / 14680
4
Two circles
7729 / 12470
5
Two factors
1953 / 5216
6
The vouchers
1220 / 1922
7
Roman numerals
2647 / 3759
8
Matches
4045 / 6037
9
N-digit numbers
2873 / 4346
10
Gardener
2756 / 3777
11
Big accuracy
3619 / 5736
12
Injured Picture
758 / 1180
13
Spider and Fly
1436 / 2604
14
Rabbit-failure
1555 / 2082
15
Mouse and corns
3598 / 4792
16
Dragon
1572 / 2492
17
Gardener-painter
3491 / 4497
18
Paint2D
700 / 1452
19
Degree of symmetry
6607 / 7847
20
How many times to repeat?
4818 / 7158
21
Corruption
117 / 1568
22
"Mirror prime" numbers
2495 / 4519
23
New-year tree
751 / 1663
24
Paint2D-Crack
39 / 261
25
Paint3D
535 / 798