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
40914 / 45813
2
Digits
23177 / 29942
3
Match’s model
2954 / 14128
4
Two circles
7474 / 12088
5
Two factors
1902 / 5060
6
The vouchers
1169 / 1845
7
Roman numerals
2536 / 3605
8
Matches
3913 / 5844
9
N-digit numbers
2771 / 4204
10
Gardener
2644 / 3633
11
Big accuracy
3535 / 5560
12
Injured Picture
735 / 1147
13
Spider and Fly
1386 / 2532
14
Rabbit-failure
1495 / 2004
15
Mouse and corns
3500 / 4671
16
Dragon
1515 / 2386
17
Gardener-painter
3318 / 4293
18
Paint2D
680 / 1415
19
Degree of symmetry
6302 / 7528
20
How many times to repeat?
4645 / 6851
21
Corruption
107 / 1494
22
"Mirror prime" numbers
2395 / 4383
23
New-year tree
724 / 1599
24
Paint2D-Crack
39 / 255
25
Paint3D
519 / 779