eolymp

Problems

Average
All Problems Very simple Simple Average Difficult Very difficult
Classification
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...
4
Two circles
9489 / 15352
6
The vouchers
1512 / 2444
7
Roman numerals
3411 / 4903
8
Matches
5063 / 7591
9
N-digit numbers
3713 / 5562
11
Big accuracy
4251 / 7151
12
Injured Picture
939 / 1420
13
Spider and Fly
1685 / 3111
16
Dragon
1874 / 2995
20
How many times to repeat?
6152 / 9217
22
"Mirror prime" numbers
3350 / 5708
25
Paint3D
703 / 1031
33
The favourite numbers of Santa Claus
1892 / 2898
36
Gorynych the Dragon
1402 / 2030
40
Pipeline (RU)
269 / 483
41
Command of the Mayor
433 / 675
48
The Red and Blue Squares
451 / 665
49
The Smart Cat
810 / 1215
50
The cut number
397 / 580
55
The presents to the 8th of March
720 / 1197
62
The Factorial
2347 / 4444
68
Metro
149 / 215
84
Transfer
48 / 75
88
LeChuck’s Revenge
83 / 130
93
Truck Driving
73 / 118