#include <iostream>
#include <bitset>
#include <string>
/*
zeroBitsEveryStep(number, step)
-------------------------------
Zeros every `step`-th bit (0-based from LSB)
but only if that bit is currently 1.
Example:
number = 536870911
step = 3 → zero bits 0, 3, 6, 9, ...
*/
int zeroBitsEveryStep(int number, int step) {
int result = number;
for (int pos = 0; pos < 32; pos += step) {
int mask = 1 << pos;
// If the bit is 1, zero it
if (result & mask) {
result &= ~mask;
}
}
return result;
}
/*
printBinary(n)
--------------
Prints a 32-bit binary representation of an integer.
*/
void printBinary(int n) {
std::bitset<32> bits(n);
std::string s = bits.to_string();
for (int i = 0; i < 32; i++) {
std::cout << s[i];
if ((i + 1) % 4 == 0) std::cout << " ";
}
}
int main() {
int number = 536870911; // 0001 1111 1111 1111 1111 1111 1111 1111
int step = 3; // zero bits 0, 3, 6, 9, ...
std::cout << "Original number in binary:\n";
printBinary(number);
int result = zeroBitsEveryStep(number, step);
std::cout << "\n\nNumber after zeroing every " << step
<< " bits (only if bit was 1):\n";
printBinary(result);
std::cout << "\n\nResult as integer: " << result << std::endl;
}
/*
run:
Original number in binary:
0001 1111 1111 1111 1111 1111 1111 1111
Number after zeroing every 3 bits (only if bit was 1):
0001 0110 1101 1011 0110 1101 1011 0110
Result as integer: 383479222
*/
