Give you a decimal number.
Calculate how many '1' in its binary string.
----
package uva10931;
import java.util.Scanner;
/**
*
* @author awesq
*/
public class UVa10931 {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
while (sc.hasNextInt()) {
int num;
if ((num = sc.nextInt()) == 0) {
break;
}
String str = Integer.toBinaryString(num);
int sum = 0;
for (int i = 0; i < str.length(); i++) {
if (str.charAt(i) == '1') {
sum++;
}
}
System.out.println("The parity of " + str + " is " + sum + " (mod 2).");
}
} catch (Exception e) {
}
}
}