I received some mail where it was pointed out to me that
my description of the sixth problem was ill defined.
The name of the algorithm to be implemented is called
'flood fill'. The inputs specify a set of coordinates
which specify which area is filled so :

 y
0 0 1 0 0 0
0 1 0 0 0 0
0 0 0 1 0 0
0 0 0 0 1 0
0 0 0 0 0 1

 y verb 0 3  
 y verb 0 4
 y verb 0 5
 ...
 y verb 3 5

0 0 1 1 1 1
0 1 1 1 1 1
0 0 0 1 1 1
0 0 0 0 1 1
0 0 0 0 0 1

 y verb 0 0
 ...
 y verb 4 4

1 1 1 0 0 0
1 1 0 0 0 0
1 1 1 1 0 0
1 1 1 1 1 0
1 1 1 1 1 1

-emmett