OJ Board

Your code is a bit complecated. Try to use 'stack' to solve this problem. In this method i got AC.

Book name: "Algorithm in C++"
Writer : Robert Sedgewick

See page no. 349. I think this is one of the most efficient algorithm about Line Segment Intersection and the best way of solve this problem.

I tested my accepted code on those data that u give and found some difference.

1
1 1 - A is a proper subset of B

1 2 2 2 3 3
2 1 1 3 - B is a proper subset of A

1 2 3
1 3 3 - A equals B

Most probably here no blank line is given as a input.

Hey...for input

0 0 5 0 2.5 2.5

my accepted program's output is:

(x - 2.500)^2 + (y + 0.000)^2 = 2.500^2
x^2 + y^2 - 5.000x + 0.000y + 0.000 = 0

So '0.000' doesn't make any sence here...
I think eric's output is correct.

Book name: "Algorithm in C++"
Writer : Robert Sedgewick

See page no. 349. I think this is one of the most efficient algorithm about Line Segment Intersection.

Best of luck....