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
42021 / 47023
2
Digits
23771 / 30660
3
Match’s model
3011 / 14398
4
Two circles
7562 / 12241
5
Two factors
1929 / 5140
6
The vouchers
1200 / 1888
7
Roman numerals
2580 / 3670
8
Matches
3975 / 5946
9
N-digit numbers
2819 / 4272
10
Gardener
2684 / 3681
11
Big accuracy
3572 / 5635
12
Injured Picture
752 / 1168
13
Spider and Fly
1400 / 2559
14
Rabbit-failure
1519 / 2032
15
Mouse and corns
3534 / 4720
16
Dragon
1532 / 2418
17
Gardener-painter
3420 / 4410
18
Paint2D
696 / 1439
19
Degree of symmetry
6391 / 7626
20
How many times to repeat?
4722 / 6999
21
Corruption
112 / 1543
22
"Mirror prime" numbers
2443 / 4453
23
New-year tree
742 / 1639
24
Paint2D-Crack
39 / 258
25
Paint3D
531 / 792