The best solution found by the algorithm must be written on an output file with extension .sln in the following format.
For each event, in the order of the problem file, one per line:
The timeslot number is an integer between 0 and 44 representing the timeslots allocated to the event.
The room is the room number assigned
to the event. Rooms are numbered in the order from the problem file, starting
at zero.