eolymp

Problems

Complexity
All Problems Very simple Simple Average Difficult Very difficult
sort-and-sequence
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...
64
The Timetable from "Diez-Product"
226 / 298
264
The greatest sequence multiple subsequence
495 / 720
971
Josephus problem
1685 / 1846
972
Sorting time
5989 / 6330
973
Maximum sum on a tree
1528 / 2270
1070
Fill the line
887 / 1255
1071
Not representable number
880 / 1007
1083
Sequence
673 / 1064
1084
Sequence (2)
169 / 275
1085
Dual lattice
33 / 48
1086
Fibonacci sequence
41 / 130
1087
Brackets sequence
231 / 334
1088
Product sum
32 / 52
1089
Марковский цикл
22 / 33
1090
Folding
73 / 92
1091
Cow Sorting
116 / 220
1092
Left Mouse Button
34 / 51
1093
Exact Symmetry
10 / 21
1094
Bubble Sort
93 / 170
1095
Bone Sort
38 / 67
1130
Graded lexicographic order
54 / 94
1329
Partition of the set
10 / 41
1344
Personal files
1938 / 2277
1462
Tricky Sorting
5114 / 5490
1618
The Longest Common Subsequence
1372 / 1513