Judge's data for 2000 Denison Spring Programming Contest

Problem1:

3
0 0 0 0 18 18 0 0 0 0
0 0 0 0 0 37 0 0 0 0
0 0 0 0 0 0 -25 -25 -25 -20
-20 -20 -20 -20 -20 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 11 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 -19 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 20 20 20 20 20 20 20 20
20 20 0 0 0 0 0 0 0 0
0 67 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 -42 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0

Problem 2:

5
JC TC 3H 4H 5H
6D KC 8H
7S QC 2H
8C 2S 4C 6S AD
8D AS 7C
6H KH 5D
KH QH JD 7C 6H
AH 2S 6C
4S 5D 3H
4H 3H 3S QD 8S
AH 6H 2H
7D 4S 3C
8S 7D 6D JC 8H
QS 5D 5C
9D 4D 3S

Problem 3:

3
5
00:30 06:00
01:00 05:30
06:30 00:30
09:20 10:00
18:00 06:30
0
10
00:00 01:10
01:00 02:00
01:10 02:00
01:20 02:00
01:20 02:00
01:30 02:00
01:40 03:00
04:30 00:20
12:00 06:00
14:20 02:10

Problem 4:

Input 1:

Program example;
int x;
  if (x > 0 then)
}}
  ))[input x;
     output x+1;
  }
THEEND

Input 2:

Program example;
int x;
  if ([{(x > 0 then)}])
]{
  ))[input x;
     output x+1;
  }
  while (x > 0) do
(((((((((((((((((((([(((((((((((((((((((
  [input x;
     output x+1;
  ]
  if [[[[[[[[[[[[[[[[[([{(x > 0 then)}])]]]]]]]]]]]]]]]]]
  [input x;
     output x+1;
  }
  if ([{(x > 0 then)}])
  [input x;
     output x+1;
  ]
)))))))))))))))))))])))))))))))))))))))
THEEND

Problem 5:

3
10 9
IFGHECBADJ
IFGJHECBAD
IJFGHECBAD
IFGHEJCBAD
IFGHECBJAD
IFGJHECBAD
IFGHJECBAD
IFGHEJCBAD
IFGHECBJAD
3 6
ABC
ACB
BAC
BCA
CBA
CAB
8 10
ABCDEFGH
BCAEFDGH
FBAGHCDE
ACDBGEHF
DABEFCHG
BACEDGFH
EFABDCHG
ABGCHDFE
ABDFECGH
DBCAFGEH