Name | Code | Successful Submission | Accuracy |
---|---|---|---|

L3 | 146 | 18.26 | |

L4 | 39 | 5.36 | |

L1 | 39 | 3.52 | |

LX | 30 | 72.16 | |

L2 | 25 | 6.9 | |

L5 | 14 | 7.34 |

**Rules:**

- Please do not discuss strategy, suggestions or tips in the comments during a live contest. Posting questions clarifying the problem statement is ok. If you are unsure, email us at feedback@codechef.com
- Contest problems will become visible on January 1st 15:00 IST.
- The contest will consist of 6-8 problems of varying difficulty.
- You will receive one point for solving a problem (passing all test cases - no partial credit), regardless of the level of difficulty of that problem.
- You can submit solutions as many times as you'd like, there are no penalties for incorrect submissions.
- Each contest will have one min/max tie breaker problem, where the best solution will receive one point and all other solutions will receive a fraction based how close they come to the best solution.
- In the unlikely case of an overall tie (including the same score on the tie-breaker) a winner will be randomly chosen from the top scorers.
**If your country is not showing up in the rankings, please submit code to any of the problems once and this would be solved.**

## RECENT COMMENTS

dsfdfAre the test cases for this problem pubic now?Whoops. That didn't work too well, but you got the address there.All problems are moved to the practice area after a contest. Go <a href="http:/...@Michae, Ajay Thanks for response. Is there any way, i can check my solution...One reason might be because the code uses printf("%lld") to print the long long va...Mohit, it's "about 15 test cases", not "at most".No response after 2 days :(I did O(n*log(n)). I used the algorithm mentioned in here: http://www.geom.uiuc....I did the incremental flip algorithm with random order insertion of vertices which...