OJ Board

I get a AC program from my friend and one set of test data

from this forum.

But some thing odd happens.




INPUT:
1

6
1 1 2 2
0 0 1 1
2 2 3 3
3 3 4 4
5 5 6 6
0 0 10 10
1 2
1 3
1 4
1 5
1 6
2 3
2 4
2 5
2 6
3 4
3 5
3 6
4 5
4 6
5 6
0 0



OUTPUT of the AC program

1 2 ...

If you can find a common point in boh lines then you can say they are connected.

For rod 1 and rod 6, we certainly can find "a" common point in

both lines because they have "infinite many" common points~~

If the argument is right, rod 1 can connect to rod 5 via rod 6.

I'm really confused ...

Sorry, I have a question. Line segment 6 overlaps all other line

segments. So the outputs should be "CONNECTED". Is that

ight? Or complete overlap of two lines does;nt constitue a

path to other line segments?

Try the cases below:

Input:
1

6
1 1 2 2
0 0 1 1
2 2 3 3
3 3 4 4
5 5 6 6
0 0 10 ...

I tested it with the inputs that I can find and all passed!
so what't wrong with it...Plz help! thx!

#include <stdio.h>
#include <stdlib.h>

struct rod
{
int x1;
int y1;
int x2;
int y2;
};
struct rod t[13];
int map[13][13];


int main(void)
{
int dataset = 0;/* how many testing datasets ...