OJ Board

Take a look here:

http://fdemesmay.dyndns.org/cs/acm/v1/114.html

The entire file will be terminated by a line consisting of a single #.

When you get to the #, stop processing data.

output for:
"abaacb
cbbaa
#
abaacb"
is:
"ababac
No Successor"

Heck :cry:

Did you at least test it?
Off course it DOESN'T work!

I'll explain the good way to test it :
open a new file in your notepad.
I'll take for granted it's name is 100.in.
copy all the sample input data, ALL the data in it.
your file should be:
100.in
"1 10
100 200
201 210
900 1000 ...

instead of doing something like

scanf("%ld %ld",&a,&b);

code

do this:

while (scanf("%ld %ld",&a,&b)==2){
code;
}

Let me guess...
You are processing data after the #

Use Gcc and compile with flags -ansi -Wall -pedantic
This way, you will never see those Compile Errors

it is NOT multiple test case ready.

process inputs as a whole file and not line by line.

Brute force it.

Generate all the data then reject the wrong ones!

it DOES work

because I've tried a lot of things and its still PE. I hate those response graphs instead of real responses!

For your entry, my solution is 30, and that's also the solution computed with my hands, so it should be correct.

I don't understand your problem, because it really IS simple and I won't give you the solution either because you would commit suicide for not having thought that yourself. So let's try ...

By the way I don'tunderstand that that: does work. I would have writen that instead: Does your code REALLY work or is it only luck if it's going through the judge tests?

src==dst
That's not a problem

"There might be more than one connection between a pair of nodes"
This is your problem, your new code is wrong.

there is a small special point : reread the text
I've changed it in your code and I got Accepted P.E.