LightOJ 1182 Parity Solution

Problem Link :  https://lightoj.com/problem/parity  

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long n,i=0,t;

    cin>>t;

    while(t--)

    {

        i++;

        cin>>n;

        cout << "Case " << i << ": ";

        if(__builtin_popcount(n)%2==0)

            cout<<"even"<<endl;

        else

        cout<<"odd"<<endl;

    }

}