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...
52
The Cheese for Anfisa
1020 / 1253
53
Anfisa’s Holiday
96 / 201
54
Murzyk
524 / 1409
55
The presents to the 8th of March
724 / 1208
56
The Butterflies
39 / 207
57
The Butterfly – Medical Attendan
4018 / 4482
58
The Billiards
1228 / 1664
59
The Cells are Painted out
70 / 153
60
Area of a Polygon
3111 / 3934
61
Cleaning up the Snow
630 / 745
62
The Factorial
2394 / 4679
63
Anfisa and the flowers
7600 / 8929
64
The Timetable from "Diez-Product"
226 / 298
65
The Candies
157 / 702
66
The Directors’ Visitors
1988 / 2408
67
Cheese for Anfisa - 2
4362 / 4876
68
Metro
156 / 228
69
Vinnis’ Friends
406 / 465
70
Industrious bees
376 / 433
71
The Expression from the Numbers
197 / 275
72
The Way Home
569 / 690
73
Phibonachies’ Numbers
550 / 710
74
Spider and Fly - 2
152 / 481
75
Pirates and coins
7222 / 8029
76
New case
5834 / 7572