Try your hand at one of the practice problems, and submit your solution in the language of your choice (our judge accepts solutions in over 35+ languages). Receive points, and move up through the CodeChef ranks. Get better, and better prepare yourself for the competitions
Name Code Successful Submissions Accuracy
Cell Phone Towers L1 39 3.52
Wildcard Matching L2 25 6.9
Lost Primes L3 146 18.26
Circle of towers L4 39 5.36
Place the balloon L5 14 7.34
Jawbreaker LX 30 72.16

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.

Announcements

CONTEST ENDED.

RESULTS:

Rankings are refreshed every few minutes.

RECENT ACTIVITY:

RECENT COMMENTS FOR THIS SECTION:

01:45 PM Jan 24th: aj2011it commented on Circle of towers: dsfdf
08:56 AM Jan 23rd: devvrr commented on Cell Phone Towers : Are the test cases for this problem pubic now?
11:20 PM Jan 20th: MichaelD commented on Lost Primes: Whoops. That didn't work too well, but you got the address there.
11:14 PM Jan 20th: MichaelD commented on Lost Primes: All problems are moved to the practice area after a contest. Go <a href="http:/...
09:25 PM Jan 20th: Shoonya commented on Lost Primes: @Michae, Ajay   Thanks for response. Is there any way, i can check my solution...
06:47 AM Jan 19th: prodigyaj commented on Lost Primes: One reason might be because the code uses printf("%lld") to print the long long va...
11:58 PM Jan 18th: MichaelD commented on Lost Primes: Mohit, it's "about 15 test cases", not "at most".
09:26 PM Jan 18th: Shoonya commented on Lost Primes: No response after 2 days :(
12:43 AM Jan 17th: balakrishnan_v commented on Place the balloon: I did O(n*log(n)). I used the algorithm mentioned in here: http://www.geom.uiuc....
10:58 PM Jan 16th: jdmetz commented on Place the balloon: I did the incremental flip algorithm with random order insertion of vertices which...
CodeChef is a global programming communityCodeChef hosts online programming competitions