eolymp
favoriteEach submission on the website costs about 0.1 UAH, last year we have processed almost 2M submissions. Click to make a small donation and help us keep going.

Problems

Simple
All Problems Very simple Simple Average Difficult Very difficult
Classification
All Problems ---topological-sort- ---traveling-salesman-problem- -three- 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 Others...
10867
Maximum in Unimodal Sequence
29 / 35
10811
Disjoint Sets Union
9 / 11
1
Simple problem
46986 / 52496
2
Digits
26702 / 34087
7
Roman numerals
2867 / 4088
10
Gardener
2993 / 4102
14
Rabbit-failure
1665 / 2230
15
Mouse and corns
3800 / 5028
17
Gardener-painter
3676 / 4743
19
Degree of symmetry
6984 / 8276
26
New-year presents
1176 / 1607
27
Cycle shifts
4222 / 5134
29
The level of palindrome
2152 / 3000
31
Superstitious Santa Claus
1186 / 1407
34
The word of sponsor
1276 / 1639
37
Mail of the sponsor
931 / 1166
39
Sponsor’s money
410 / 578
43
Competitors’ quantity of olimpia
2721 / 3735
46
The Segments
1264 / 1637
47
The Parquet of the Triangles
607 / 796
51
The Cost of the K-dominoes
812 / 944
52
The Cheese for Anfisa
805 / 1008
57
The Butterfly – Medical Attendan
3594 / 4002
58
The Billiards
1039 / 1397
60
Area of a Polygon
2526 / 3231