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.5187
Circle of towers L4 39 5.3560
Jawbreaker LX 30 72.1634
Lost Primes L3 146 18.2602
Place the balloon L5 14 7.3394
Wildcard Matching L2 25 6.9030

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.

RESULTS:

Rankings are refreshed every few minutes.

RECENT ACTIVITY:

RECENT COMMENTS

11:11 PM Sep 2nd: atul commented on Trees Again:   @ govardhan reddy your example does not satisfy the property of tree
10:33 PM Sep 2nd: ishan dutta commented on Bytelandian Shoppers: "every item is brought by atleast one person".How can one single item be bought by...
10:30 PM Sep 2nd: vishal gupta commented on Cipher: give some more good test cases.....
10:28 PM Sep 2nd: vishal gupta commented on Cipher: wht the hell..!! prog. is taking all cases on my compiler but still getting wrong ...
09:49 PM Sep 2nd: govardhan reddy commented on Trees Again: How many subtrees should i get for the following test case:  ( Tell if this case ...
09:24 PM Sep 2nd: ankit anand commented on Cipher: giver some more testcases
08:47 PM Sep 2nd: govardhan reddy commented on Trees Again: A directed tree is a directed graph which would be a tree if the directions ...
07:57 PM Sep 2nd: Admin commented on Bytelandian Shoppers: @ashish: You are not allowed to discuss the complexity of the solution during the ...
06:53 PM Sep 2nd: varun sapra commented on Cipher: my program is satisfying all the test cases.....but it is still being evaluated as...
06:42 PM Sep 2nd: Ravi Maggon commented on Cipher: Look i am giviny you the logic of what exactly you have to do. From a given input...