The Dink Network

I studied Pascal from 2002. I don't think you could compete on this contest because you're not from Romania, and this is the a Romanian contest. You don't have to do a project or something. You have three hours to make two programs. Usually, you read some datos from a file and you should create another file with some other datos(e.g.: you read a maze from a file, and you have to print the solution). There are some automatic evaluators that runs your programs and checks your solution. And the most important thing is that your programs have a time limit(usually 1second). The evaluators give several tests. The first ones are easy, so your programs finds the solution in less than 1sec, nomatter what method you use. But for most of the tests, backtracking, or any other exponential alghoritms are useless.
Wish me luck.