eolymp

Problems

Complexity
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...
76
New case
5673 / 7336
77
The Garland
753 / 1049
78
Islands
96 / 205
79
The Genome of Newton
53 / 154
80
Discounts
725 / 896
81
Points
46 / 125
82
Catacombs
25 / 69
83
Gnome’s toys
973 / 1185
84
Transfer
48 / 75
85
Spiral
2589 / 2928
86
Waterpipe - 2
391 / 515
87
Robot
4352 / 5221
88
LeChuck’s Revenge
83 / 130
89
Cube Painting
800 / 890
90
Gold, Food and Power
30 / 65
91
A Piece of Paper
3 / 36
92
Subprojects
1287 / 1434
93
Truck Driving
73 / 118
94
Primes’ Problem
57 / 91
95
No More Hapalies!
348 / 487
96
Automat
7 / 38
97
Bell numbers
85 / 103
99
Lines
8 / 40
100
Pareto domination
8 / 72
101
Permutations with given distance
12 / 29