eolymp

Problems

Very difficult
All Problems Very simple Simple Average Difficult Very difficult
geometry
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...
56
The Butterflies
39 / 205
600
Адронные коллайдеры
2 / 19
667
Circle and triangle (RU)
40 / 135
1036
Path to the parallelepiped
8 / 39
1037
M-gon
5 / 19
1049
Right-angled Triangle
22 / 106
1100
Полезная площадь
5 / 31
1353
Segment in a coordinate system
148 / 593
1478
Rectangle
16 / 119
1479
Rectangles-1
11 / 49
1481
Rectangles-3
1 / 8
1657
Прямоугольники
91 / 630
1699
Отрезки на прямой возвращаются
12 / 40
1701
Square Counting
3 / 20
1829
Tangent to the sphere
2 / 10
2221
About love...
18 / 91
2251
Супермногоугольники
1 / 10
2294
Convex Hull
24 / 110
3168
Minimum area bounding box
2 / 7
3169
Burn after reading
7 / 38
3170
Clear after burning
2 / 10
3508
Full Steiner Topologies
11 / 39
4279
Выпуклая оболочка
11 / 69
4770
Река
7 / 54
4772
Правильный многоугольник
20 / 77