Thursday, 6 April 2017

Geeksforgeeks Solution For " Set Bits "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Given a positive integer N, print count of set bits in it. For example, if the given number is 6, output should be 2 as there are two set bits in it.

Submit Your Solution :- Click Here 

Solution :- 

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,i,j,tmp=0;
        cin>>n;
        while(n!=0)
        {
            i=n%2;
            if(i==1)
            {
            tmp++;
            }
            n=n/2;
        }
        cout<<tmp<<endl;
    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Set Bits "

No comments:
Write comments

Recommended Posts × +