OJ Board

brianfry713 wrote:Try solving it without using floating point.

It doesn't work.

Don't read and write to a file. For input: 0, 0
2, 0
1, 1
2, 2
0, 2
0, 0

0, 0
2, 0
1, 1
2, 2
0, 2
0, 0 Output should be: 0, 0
2, 0
2, 2
0, 2
0, 0

0, 0
2, 0
2, 2
0, 2
0, 0
I change the way of reading data?
And the result is still WA?
I generate the random I/O and get the answer by myself ,
the ...

Thank you,I found my function to check inLine was wrong.
Thank you again for helping me.

Does this problem have some tricks?
I use the data I can find this forum,and can get the correct answer.
But when I submit this problem,always get the WA.
Does it have something to pay attention to?
:(
my code below:

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath ...

I believe there is a case like this in the judge's input, where a line is repeated: 2

2
0 0 1000 1000
1000 1000 0 0

2
0 0 1000 1000
0 0 1000 1000 My AC code prints 2 for both.
Thank you! I got this bug fixed.
And still get WA,I'm confused.
I check the lines repeated and the lines cover the bound ...

I just have submitted this problem 10 times,and can't get AC yet.
I don't know what's wrong with my code.
Maybe who can help me? :roll:
there is my code.

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <fstream>
#include <algorithm>
#include ...

brianfry713 wrote:The outputs of two consecutive cases will be separated by a blank line.
Don't print an extra blank line at the end of the output.

Thanks for your reply,I get AC now

I calculated every two straws to check if they were intersected.
And I get the array link [j] to show if straw i is connected with straw j.
Then I used floyd algorithm to get all link [j].

I have tried many i/o but I it doesn't work.

Here is my code

#include <cstdio>
#include <cstdlib>
#include ...