eolymp

Problems

Complexity
All Problems Very simple Simple Average Difficult Very difficult
All Problems ---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 diophantine-equations Others...
1
Simple problem
56120 / 62722
2
Digits
32503 / 40962
3
Match’s model
4160 / 18943
4
Two circles
9490 / 15353
5
Two factors
2424 / 6547
6
The vouchers
1512 / 2445
7
Roman numerals
3413 / 4903
8
Matches
5064 / 7595
9
N-digit numbers
3714 / 5564
10
Gardener
3608 / 5028
11
Big accuracy
4252 / 7154
12
Injured Picture
939 / 1421
13
Spider and Fly
1686 / 3112
14
Rabbit-failure
1954 / 2650
15
Mouse and corns
4648 / 5977
16
Dragon
1875 / 2997
17
Gardener-painter
4592 / 5866
18
Paint2D
912 / 1833
19
Degree of symmetry
7959 / 9393
20
How many times to repeat?
6175 / 9243
21
Corruption
286 / 2050
22
"Mirror prime" numbers
3351 / 5709
23
New-year tree
1015 / 2211
24
Paint2D-Crack
67 / 399
25
Paint3D
704 / 1032