OJ Board

Try your program on

1
0 2 0 3 0 0 1 1

Output should be 'F'!

Nice heuristic, but nothing more than that...
Can you PROOF your algorithm is correct?

try for input:

3
2 1
0 2
1 2

output should be:

0 -1 -1
0 -1 -1
0 -1 -1

you get:

0 -1 1
0 -1 -1
0 -1 -1

Try the following inputfile

cbbaa
a
a
#

output should be:

No Successor
No Successor
No Successor

but in your case I get a `Segmentation fault'

1. 300 seconds is not 5 hours, but 5 minutes

2. At the end of your program you never print hours only lots of minutes!!
see: printf("00:%02d:%02d\n",now/60,now%60);

Do you really need that much precision to get the correct answer?

There are a bit more solutions than 4 for the 8-queen problem.

I can add that in one testcase a : (colon) is used where perhaps
a ; (semicolon) would be expected. One testcase must contain something like:

A:B:C