Perl (Bob)
$_=<>;
INPUT:{
tr/ /,/;
@in = eval;
for(1..$#in){
$bids[$rnum][$in[$_]]++
}
for(0..$#in){
$tbids[$rnum][$in[$_]]++
}
$rnum++;
$_=<>;
if($_ ne"\n"){redo INPUT}
}
for(0..100){$pre[$_]=0}
blazer: {
for($r=1;$r<$rnum;$r++){
winner: for($pnt=1;$pnt<101;$pnt++){
if($tbids[$r][$pnt] == 1){
if($pnt > 2){
$winnum[$pnt]++;
$wins++;
}
last winner
}
}
}
if($wins==0){
$pre[3]++;last blazer
}
}
CC1: for($pnt=1;$pnt<101;$pnt++){
if($tbids[$rnum-1][$pnt] == 1){
$pre[$pnt]++;last CC1
}
}
CC2: for($pnt=1;$pnt<101;$pnt++){
if($rnum-2<0){$pre[7]++;last CC2}
if($tbids[$rnum-2][$pnt] == 1){
$pre[$pnt]++;last CC2
}
if($pnt==100){
$pre[7]++;last CC2
}
}
one: {
$pre[1]+=2;
}
two: {
$pre[2]+=2;
}
five: {
$pre[5]+=2;
}
eight: {
$pre[8]+=2;
}
fortytwo: {
$pre[42]++;
}
mueller: {
$a=($#in+2)/4;
$pre[int$a]++;
}
schwarzenbeck: {
$a=($#in+2)/4+1;
$pre[int$a]++;
}
beckenbauer: {
$a=($#in+2)/4+2;
$pre[int$a]++;
}
totalbots: {
$pre[$#in+1]++;
}
joe: {
$sum=0;
for(1..100){
$sum+=$_*$tbids[$rnum-1][$_];
}
$average=$sum/($#in+1);
if($average==0){$average=10};
$pre[$average]++;
}
node: {
$max=0;$maxloc=0;
for(1..100){
if($tbids[$rnum-1][$_]>$max){$max=$tbids[$rnum-1][$_];$maxloc=$_}
}
$maxloc--;
#if($maxloc==0){
$maxloc=20;
#}
if($rnum==1){$maxloc=3}
$pre[$maxloc]++;
}
choice: for(1..100){
if($pre[$_]==1){
$count++;
if($count==3){print; last choice}
}
if($_==100){print"98"}
}
See "Bob" for how to invoke.