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
40042 / 44862
2
Digits
22527 / 29217
3
Match’s model
2852 / 13775
4
Two circles
7349 / 11891
5
Two factors
1885 / 4982
6
The vouchers
1134 / 1792
7
Roman numerals
2479 / 3521
8
Matches
3776 / 5675
9
N-digit numbers
2710 / 4119
10
Gardener
2591 / 3557
11
Big accuracy
3505 / 5467
12
Injured Picture
716 / 1124
13
Spider and Fly
1349 / 2485
14
Rabbit-failure
1455 / 1942
15
Mouse and corns
3387 / 4545
16
Dragon
1478 / 2331
17
Gardener-painter
3175 / 4121
18
Paint2D
667 / 1391
19
Degree of symmetry
6137 / 7336
20
How many times to repeat?
4572 / 6750
21
Corruption
97 / 1471
22
"Mirror prime" numbers
2325 / 4275
23
New-year tree
710 / 1566
24
Paint2D-Crack
39 / 248
25
Paint3D
511 / 768