UVa 10931 - Parity

10931 - Parity

 * http://acm.uva.es/p/v109/10931.html

Summary
Figure out how many 1's are in a binary number for the decimal number they give you.

Explanation

 * This is most easily done by keeping track of the 1's and continuously bitshifting until the number is 0.
 * The constraints are 31 bits of all 1's 2^31-1 so just integer will suffice.