OJ Board

Hi, i keeping getting WA even though i tried on my inputs i devised myself. Any one able to help with any input cases?

Thanks alot!

Hi,

I have passed all the inputs in this thread but still getting WA. anyone with any more tricky cases?

Thanks alot for any help!

Hi,

can anyone help with advice on the input? it's seem like it is very very tricky. So far my program has been able to handle the below input,

Input
8 = (2 0 10 0)
12 = (10 0 2 0)
10 = 10 20
10 = (5 0 0 5)
9 = ( ( ( 18) ) ) ( ( ( 9 ) ) )((1))
0 = 0
100 = 10 10
45 =((1)) 2( ( 3 4)( 5 6) 7 )8 9 ...

hi....
does anybody has any idea wat the judge input is like?
i keep getting time limit exceeded even though i dun use any recursion!

thanks!

im able to solve tat case also........
but still WA....... its screwed....

hi!

you can check out the link http://icpc.cc.ntu.edu.tw/ncpc1998/problems/
but even though i manage to get the same output for the data set provided im still geting WA.....

its weird......

im not too clear about the line in the problem statement saying tat
no neighbouring points are collinear..... wats does neighbouring mean exactly?

anyhow, im using jarvis march.... when points are collinear, the one with the greatest length is chosen, tat should be correct rite?

im starting the ...

Hi.....

are there any special case to look out for in the input cases??
i keep getting WA...

can n <= 3?