Jan’s LightOJ :: 1182 – Parity Solution

1182 - Parity Solutoin
 

    #include <stdio.h>
    int oneCount(int n)
    {
            int count = 0;
            while(n>0)
            {

                    if(n%2==1) count++;
                    n/=2;
            }
          return count;

    }

    int main()
    {
            int T;
            unsigned long long int n;
            scanf("%d",&T);
            int i;
            for(i =0; i<T;i++)
            {
                    scanf("%lld",&n);
                    if(oneCount(n)%2==0)
                    printf("Case %d: even\n",i+1);
                    else
                    printf("Case %d: odd\n",i+1);

            }
    return 0;


    }