/* Binary consecutive bit counter. Usage Example: Enter some integer numbers in Code Playground input dialog, separated by new line; 13 7 2018 ... @ Ipang © 2018 SoloLearn Community */ #include #include /* function measureBits Description: Measures how many bits is needed to fit a number. This function is used to calculate how many characters is needed to build a binary string number, when the input number exceeds the limit of unsigned int32. Parameters: long long Number to check Return value uint Number of bits required to fit the number */ unsigned int measureBits(long long n) { unsigned long long v {4294967296}; unsigned int bitNeeded {32}; for(; v <= n; v *= 2, ++bitNeeded); return bitNeeded; } /* Function bitSeqCounter Description: Calculate maximum number of sequential/consecutive bit in a number Parameters: long long Number to check (must be positive) string [OUT] Binary number as string int [OUT] Total bit 0 int [OUT] Total bit 1 int Indicates which bit to count, zero or one. uint Max bits calculated (default 32) Return value: int, longest consecutive bits. Known issue: - Only works with positive value. I still don't quite understand binary of negative numbers. - I haven't checked thoroughly the zero bit counter. If you find a mistake please let me know in the comments. Thanks : ) */ int bitSeqCounter( long long n, std::string& outBinStr, int& outTotalZero, int& outTotalOne, int bitToCount = 1, unsigned int bits = 32) { // This works only with positive number if(n <= 0) return 0; // Min and max bits allowed if(bits < 8) bits = 8; else if(bits > 63) bits = 63; // Check if the number will fit in bits if(n > 4294967295ULL && bits <= 32) { // Measure bit needed, exit on failure bits = measureBits(n); if(!bits) return 0; } unsigned long long ret {1}; unsigned int last {bits - 1}; int m {0}, c {0}; std::string bstr(bits, 48); outTotalZero = bits; outTotalOne = 0; for(unsigned int i = 0; i < bits; i++) { if(n & ret) { bstr[last - i]++; outTotalZero--; outTotalOne++; if(bitToCount) { c++; if(c > m) m = c; } else c = 0; } else { if(bitToCount) c = 0; else { c++; if(c > m) m = c; } } // Loop optimization if(ret > n) { if(!bitToCount) if(bits - i > m) m = bits - i; break; } ret *= 2; } outBinStr = bstr; return m; } // Main procedure int main() { // We're counting bit 1. int bitToCount {1}; // std::cout << "Enter bit to count (0 or 1): "; // std::cin >> bitToCount; // bitToCount = bitToCount ? 1 : 0; std::cout << "Enter positive integer values separated by new line"; long long n {0}; std::string bin_str; int rv, t0 {0}, t1 {0}; // Read on while not blank while(true) { std::cin >> n; if(!std::cin.good()) break; if(n < 1) continue; rv = bitSeqCounter(n, bin_str, t0, t1, bitToCount); std::cout << "\n\n[Decimal]\n" << n << "\n[Binary : " << (t0 + t1) << " bit]\n" << bin_str << "\nLongest consecutive bit (" << bitToCount << "): " << rv << "\nTotal bit (0): " << t0 << " , bit (1): " << t1; } return 0; }

Challenge - Binary bit counter