eolymp
bolt
Try our new interface for solving problems
Try

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
5100 / 6131
769
Rectangle
2002 / 2220
1612
Change the one
2398 / 2567
1645
Binary number
840 / 1209
1648
Fenwick Function
2923 / 3150
1753
Lowest Bit
2113 / 2329
1780
Коды Грея
284 / 345
2616
Lost card
3355 / 3825
2802
Bitset
854 / 1069
2807
Cubes - 3
1781 / 2162
2813
Binary Stirling Numbers
47 / 125
2817
Binary Numbers
631 / 724
3022
Persistent Bits
122 / 134
5050
Degree of two
3025 / 3126
5314
2^k + 2^n
4366 / 4645
5315
Set a bit
2144 / 2281
5316
Invert a bit
2110 / 2260
5317
Bit value
2141 / 2343
5318
Reset the significant bits
1979 / 2144
5319
Reset a bit
2041 / 2173
5320
Complementary code - 1
766 / 902
5321
Complementary code - 2
162 / 213
5718
Big difference
1172 / 1289
5868
A xor B
2230 / 2287
6311
Клавиатура
784 / 904