Hey icy
 I think that would be better. we should have it next week. I think I have a
decent solution to the following problem. I can present it if people are
interested.
Sunil.

*
*

*BitVector Genealogy*

The BitVectors are an ancient and immortal race of 10,000, each with a
10,000 bit genome. The race evolved from a single individual by the
following process: 9,999 times a BitVector chosen at random from amongst the
population was cloned using an error-prone process that considers each
bit independently, and flips it with 20% probability.

Write a program to guess the reproductive history of BitVectors from their
genetic material. The randomly-ordered file
bitvectors-genes.data.gz<http://www.itasoftware.com/careers/work-at-ita/PuzzleFiles/bitvectors...>contains
a 10,000 bit line for each individual. Your program's output should be, for
each input line, the 0-based line number of that individual's parent, or -1
if it is the progenitor. Balance performance against probability of mistakes
as you see fit.

To help you test your program, here is a much smaller 500 x 500 input
dataset:bitvectors-genes.data.small.gz<http://www.itasoftware.com/careers/work-at-ita/PuzzleFiles/bitvectors...>,
along with its solution
file:bitvectors-parents.data.small<http://www.itasoftware.com/careers/work-at-ita/PuzzleFiles/bitvectors...>
.

Sunil.