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...
51
The Cost of the K-dominoes
897 / 1033
52
The Cheese for Anfisa
948 / 1171
53
Anfisa’s Holiday
96 / 198
54
Murzyk
522 / 1396
55
The presents to the 8th of March
720 / 1197
56
The Butterflies
38 / 198
57
The Butterfly – Medical Attendan
3909 / 4359
58
The Billiards
1176 / 1583
59
The Cells are Painted out
67 / 147
60
Area of a Polygon
2981 / 3755
61
Cleaning up the Snow
576 / 683
62
The Factorial
2348 / 4446
63
Anfisa and the flowers
7380 / 8687
64
The Timetable from "Diez-Product"
216 / 281
65
The Candies
150 / 667
66
The Directors’ Visitors
1909 / 2305
67
Cheese for Anfisa - 2
4230 / 4734
68
Metro
149 / 215
69
Vinnis’ Friends
396 / 451
70
Industrious bees
374 / 429
71
The Expression from the Numbers
193 / 267
72
The Way Home
568 / 684
73
Phibonachies’ Numbers
540 / 695
74
Spider and Fly - 2
148 / 468
75
Pirates and coins
7015 / 7788