Sep 27, 2025 · Sep 27, 2025 · Sep 27, 2025
diff --git a/bit_manipulation/count_of_set_bits.cpp b/bit_manipulation/count_of_set_bits.cpp
 * @returns total number of set-bits in the binary representation of number `n`
 */
 std::uint64_t countSetBits(
    std ::int64_t n) {  //int64_t is preferred over int so that
    std ::uint64_t n) {  //uint64_t is preferred over int so that
                        // no Overflow can be there.
                        //It's preferred over int64_t because it Guarantees that inputs are always non-negative,
                        //which matches the algorithmic problem statement.
                        //set bit counting is conceptually defined only for non-negative numbers.
                        //Provides a type Safety: Using an unsigned type helps prevent accidental negative values,

    std::uint64_t count = 0;  // "count" variable is used to count number of set-bits('1')
                            // in binary representation of number 'n'
                            //Count is uint64_t because it Prevents theoretical overflow if someone passes very large integers.
                            //  Behavior stays the same for all normal inputs.
                            // Safer for edge cases.

    int count = 0;  // "count" variable is used to count number of set-bits('1')
                    // in binary representation of number 'n'
    while (n != 0) {
        ++count;
        n = (n & (n - 1));
diff --git a/math/number_of_positive_divisors.cpp b/math/number_of_positive_divisors.cpp
 **/

 #include <cassert>
 #include <iostream>

 /**
 * Function to compute the number of positive divisors.
 */
 int main() {
    tests();
    int n;
    std::cin >> n;
    if (n == 0) {
        std::cout << "All non-zero numbers are divisors of 0 !" << std::endl;
    } else {
        std::cout << "Number of positive divisors is : ";
        std::cout << number_of_positive_divisors(n) << std::endl;
    }
    return 0;
 }
Original file line number	Diff line number	Diff line change
Expand Up		@@ -36,11 +36,19 @@ namespace count_of_set_bits {
		* @returns total number of set-bits in the binary representation of number `n`
		*/
		std::uint64_t countSetBits(
		std ::int64_t n) { //int64_t is preferred over int so that
		std ::uint64_t n) { //uint64_t is preferred over int so that
		// no Overflow can be there.
		//It's preferred over int64_t because it Guarantees that inputs are always non-negative,
		//which matches the algorithmic problem statement.
		//set bit counting is conceptually defined only for non-negative numbers.
		//Provides a type Safety: Using an unsigned type helps prevent accidental negative values,

		std::uint64_t count = 0; // "count" variable is used to count number of set-bits('1')
		// in binary representation of number 'n'
		//Count is uint64_t because it Prevents theoretical overflow if someone passes very large integers.
		// Behavior stays the same for all normal inputs.
		// Safer for edge cases.

		int count = 0; // "count" variable is used to count number of set-bits('1')
		// in binary representation of number 'n'
		while (n != 0) {
		++count;
		n = (n & (n - 1));
Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -23,7 +23,6 @@
		**/

		#include <cassert>
		#include <iostream>

		/**
		* Function to compute the number of positive divisors.
Expand DownExpand Up		@@ -80,13 +79,5 @@ void tests() {
		*/
		int main() {
		tests();
		int n;
		std::cin >> n;
		if (n == 0) {
		std::cout << "All non-zero numbers are divisors of 0 !" << std::endl;
		} else {
		std::cout << "Number of positive divisors is : ";
		std::cout << number_of_positive_divisors(n) << std::endl;
		}
		return 0;
		}