Thursday, 16 March 2017

Geeksforgeeks Solution For " Parity of unsigned integer "

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

Problem :- Given an unsigned integer, find it's parity. Parity of a number refers to whether it contains an odd or even number of 1-bits. The number has “odd parity”, if it contains odd number of 1-bits and is “even parity” if it contains even number of 1-bits.

Submit Your Solution :- Click Here 


Solution :-

#include <iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
       int n,even=0,odd=0,tmp=0;
       cin>>n;
       while(n>0)
       {
           if(n%2==1)
           {
               even++;
           }
           else
           {
               odd++;
           }
           n=n/2;
       }
       
       if(even%2==0)
       cout<<"even\n";
       else
       cout<<"odd\n";
    }
    return 0;
}

Output:-

Geeksforgeeks Solution For " Parity of unsigned integer "

No comments:
Write comments

Recommended Posts × +