OJ Board

HINT: for all people trying to solve this problem, read about rotating callipers and an algorithm for the minimum area rectangle enclosing a convex polygon.
link: http://www.cs.purdue.edu/research/techn ... 83-463.pdf

Your code is O(n!), of course it'll give TLE, just try this input Output: My code gives the answer in no time so try another algo

problem 933 - Water Flow has no html and no input

Please fix the input

Anyone who has solved this problem has critical input?? i don't catch my mistake, here's my algo:
1. With the direction angle and the spread get the two lines.
2. Test with cross product where they are from the circle
3. If they cover the entire circle return pi * r^2
4. if they cover nothing from ...