OJ Board

Thanx a lot ... That was the same mistake i had made too... i will correct it and try submitting Gosh... i was breaking my head as to why it failed ..

Thanx.. i was able to figure out the code...

How do i solve this problem?.. Any clues.....
And also how do i solve related problems....
For example.. this problem.....

There is a pile of sticks.... say K sticks...
There are 2 players.......

The players pick at alternate turns....

Each player can pick a maximum of all but one stick... and a ...

yeah the test case you gave me failed my code... but then i removed that portion of the code that removed those intermediary points...
But how come...
Even if the T shirt folds properly ..... then all points need not overlap...

Anyway even after removing that portion my code fails with a wrong ...

I have no idea as to how to go about solving this problem...
Is there a DP soln... please explain.....

Thanx......... i will try it ...........

I am not able to understand.....
How can it be a linear time algo.....?
Does that make it a greedy solution? Can you explain your algo.. i am not able to get a proper soln

Can any body explain the algo....... Is it pure math....??
I try calculating the probabilities ... but i always endup getting wrong answer

please help

I always get wrong answer ...

What i do is this....

1) I obtain only the corner points. For this i take 3 points at a time (continuos) and check the area of the triangle formed... if it is 0 i remove the middle point... i do this for all the points until i am left only with the points which are ...

Hi.....
Is there any problem with 10331 the flyover construction problem testdata.
My algo is....
First i do a Floyd warshall...
then i do a procedure to find all the shortest paths.. (not exactly DFS) but i do a procedure that is more optimal...i am pretty sure that works....
(bcoz first i did a ...