| Name | Code | Successful Submissions | Accuracy |
|---|---|---|---|
| Treasure Hunting | N1 | 118 | 20.73 |
| Heroes of Magical Might | N2 | 21 | 5.17 |
| K-important Strings | N3 | 94 | 18.7 |
| Tri-Hexagonal Puzzle | N4 | 138 | 36.47 |
| Traffic jam | N5 | 34 | 4.48 |
| The Best Tower | NX | 67 | 66.13 |
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 March 1st 2010.
- 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.

Fetching successful submissions

RECENT COMMENTS FOR THIS SECTION: