Site hosted by Angelfire.com: Build your free website today!

INPUT

The solver and his Input/Output was compiled by C/C++ GNU compiler. It was only used C code (http://www.bloodshed.net/devcpp.html) . INPUT: One DOS(MS Windows XP) directory. In 3rd level of directory depth, the files found, it will be assumed that is the problems. The path sequence should not be bigger than 800 char, otherwise it might not be solved. Problem files: To write on then, it can be used the fwrite C funtion. the problem is described as the follow sequence: dimension: number of cities ( unsigned long int ) from 4 ... 800. code ( unsigned long int ) value 0. maxValue: maximum value of matrix entry ( long int ) from 0 ... 2,000,000,000. dimension*dimension matrix values ( long int ) from 0 ... maxValue, line by line. files to contest: Also written by fwrite C function and relative to one problem's solution claim: dimension: number of cities ( unsigned long int ) from 4 ... 800. code ( unsigned long int ) value 2. maxValue: maximum value of matrix entry ( long int ) from 0 ... 2,000,000,000. path: Problem's path. Size MAXIMUM_PATH array of ( char ). MAXIMUM_PATH = 1024. The path is in the following form: "Directory name"\"request random number"\\"Problem name" (All names in "..." are relative to the problem, to contest, from the day it was sent). vertices sequence of one best sequence or a valid one: one array, of size dimension, with values ( unsigned short int ) of the index cities. The solution is a connecting ring of cities. If the array[i] == j, means than the (i+1)th city links the (j+1)th city, or the (i+1)th line links the (j+1)th city.

Links:

Main page
Overview and payment method
Prices
OUTPUT

Email: ATSP2005@walla.com