WA in SICRANO http://www.spoj.pl/problems/SICRANO/

[TLE__sof]

i dont have patience to read this much length of code like leppy sir
but what i caught in 3 seconds was

m1=(points[j][1]-start[i][1])/(points[j][0]-start[i][0]);

if points[j][0]=0 and start[i][0]=0;
x/0 underministic
and rest follow what sir say

[pv1]

@Leppy-----i worked on some more furious test cases and debugged my code .............CODE REMOVED

[leppyr64]

Please fix your indentation. Please explain your algorithm. Please explain why you think this algorithm is accurate.

[numerix]

I have some trouble with that problem though it looks like an easy one. I'm not sure if it's a matter of wrong logic, I/O problem (with Python) or just misunderstanding the problem description. "Segment" is a rectangle, right?

For this testcase from a post above:

1
4 5
0 3
2 2
3 3
4 4
0 0 5 5
3 3 4 4
0 0 1 0
0 0 0 1
0 0 0 5

The output should be:

4
2
0
0
1

Right?

[leppyr64]

m.cliffsnotes.com/study_guide/Se ... 18771.html

[numerix]

Thanks a lot, leppy! Neither my printed dictionary nor the google translator did offer the correct meaning.