## DWITE '07 R5 #3 - Parity bit

View as PDF

Points: 5
Time limit: 2.0s
Memory limit: 64M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig
##### DWITE Online Computer Programming Contest, February 2008, Problem 3

A parity bit is a binary digit that is added to ensure that the number of bits with value of in a given set of bits is always even or odd. Parity bits are used as a simple validation code, for example to test that all the data has arrived correctly in a transmission. For this question we'll be using even parity bit – that is, we want to add a bit ( or ) so that the total number of high bits () is even.

For example, consider integer . Binary representation of is 1101. Number of high bits in 1101 is , which is odd. To make it even, the parity bit must also be high, so .

The input will contain 5 lines, integers .

The output will contain 5 lines – a single integer, or , representing a bit that needs to be added to form an even parity.

#### Sample Input

0
1
2
3
4

#### Sample Output

0
1
1
0
1