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"
221 / 291
264
The greatest sequence multiple subsequence
481 / 700
971
Josephus problem
1659 / 1819
972
Sorting time
5826 / 6159
973
Maximum sum on a tree
1502 / 2242
1070
Fill the line
864 / 1226
1071
Not representable number
822 / 936
1083
Sequence
645 / 1030
1084
Sequence (2)
164 / 270
1085
Dual lattice
32 / 47
1086
Fibonacci sequence
39 / 121
1087
Brackets sequence
230 / 333
1088
Product sum
31 / 49
1089
Марковский цикл
20 / 31
1090
Folding
72 / 88
1091
Cow Sorting
113 / 216
1092
Left Mouse Button
34 / 51
1093
Exact Symmetry
10 / 19
1094
Bubble Sort
89 / 164
1095
Bone Sort
35 / 62
1130
Graded lexicographic order
54 / 92
1329
Partition of the set
10 / 41
1344
Personal files
1886 / 2210
1462
Tricky Sorting
4972 / 5334
1618
The Longest Common Subsequence
1335 / 1477