eolymp

Problems

Complexity
All Problems Very simple Simple Average Difficult Very difficult
bitwise-operators
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...
27
Cycle shifts
4845 / 5849
769
Rectangle
1828 / 2019
1612
Change the one
2158 / 2317
1645
Binary number
772 / 1103
1648
Fenwick Function
2649 / 2869
1753
Lowest Bit
1948 / 2160
1780
Коды Грея
280 / 342
2616
Lost card
3013 / 3423
2802
Bitset
794 / 1006
2807
Cubes - 3
1626 / 1999
2813
Binary Stirling Numbers
45 / 127
2817
Binary Numbers
573 / 666
3022
Persistent Bits
115 / 127
5050
Degree of two
2754 / 2849
5314
2^k + 2^n
3770 / 4015
5315
Set a bit
2018 / 2145
5316
Invert a bit
2013 / 2161
5317
Bit value
1989 / 2187
5318
Reset the significant bits
1832 / 1992
5319
Reset a bit
1950 / 2081
5320
Complementary code - 1
672 / 803
5321
Complementary code - 2
143 / 187
5718
Big difference
1084 / 1200
5868
A xor B
2107 / 2166
6311
Клавиатура
710 / 832