Skip to main content

Program to find the number of 1's bit in a number



#include<bits/stdc++.h>
using namespace std;
// this is the program to find the number of 1's bit in a number
int count1nsBit(int n)
{
    int count=0;
    while (n)
    {
        n= n & n-1;
        count++;
    }
    return count;
}

int main()
{
    int n;
    cin>>n;
    cout<<count1nsBit(n);
    return 0;
}
/*
input an output tast are comments
*/

Comments

  1. input: 7
    output: 3

    input: 8
    output: 1

    input: 512
    output: 1

    input: 999
    output: 8

    ReplyDelete

Post a Comment

Popular posts from this blog

7 features of OOPs

The 7 features of OOPs are as follows: 1. Incapsulation 2. Abstraction 3. Inheritance 4. Polymorphism 5. Object must be used 6. Massage passing : One object can interect with another object 7. Dynamic binding The most initial 4 are the basic OOPs features that is required.

Sieve Erotosthenes program in c++

  #include <bits/stdc++.h> using namespace std ; /* this program is for finding the prime number till the given number */ void primeSieve ( long long n ) {     long long prime [ n + 1 ] = { 0 };     for ( long long i = 2 ; i <= n ; i ++ )     {         if ( prime [ i ] == 0 )         for ( long long j = i * i ; j <= n ; j += i )         {             prime [ j ] = 1 ;         }             }     for ( long long i = 2 ; i <= n ; i ++ )     {         if ( prime [ i ] == 0 )         cout << i << " " ;     }         } int main () {     long long n ;     cin >> n ;     primeSieve ( n );     return 0 ; }

Array Data Structure