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
The Bytelandian Union A8 2 5.97
Product of divisors D1 72 6.43
The Lucky Draw D2 29 11.44
The battlefield D3 21 28.57
Primes in the GCD table D4 9 2.62
Count the squares D6 70 23.86
Alien Clock D7 6 2.87
Pack the balls in a box! DX 13 46.55

Updates:

  • June 8th - 3:15pm - There was an issue with the test data for D4, this has been fixed, rejudge in progress.
  • June 8th - 12:30pm - D3 constraints updated from 1 = K = N-2 to 0 = K = N-2.
  • June 4th - 3:00pm - D3 constraints updated from 3<=N<=1000 to 3<=N<=2000.
  • June 3rd - 2:00pm - DX time limit increased to 5sec. Rejudge in progress.
  • June 1st - 6:00pm - D1 constraints updated from 2<=N<=500,000 to 1<=N<=500,000.


Rules:

  • Contest problems will become visible on June 1st 15:00 IST.
  • The contest will consist of 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 (i.e. Pack the balls in a box), 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.


Prizes are only available to users within India

CONTEST ENDED.

RESULTS:

Rankings are refreshed every few minutes.

RECENT ACTIVITY:

RECENT COMMENTS FOR THIS SECTION:

02:12 AM Aug 23rd: jassi9c commented on Product of divisors: Very simple
09:51 PM Jun 14th: nandish_83 commented on Product of divisors: Why is the solution submission option removed? We can still see few users uploadin...
05:28 AM Jun 14th: kumaranurag commented on Product of divisors: can i submit the code now. i just want to check whetreh my code is good.?
11:26 PM Jun 11th: ambar commented on Product of divisors: Has the submission been stopped? But I can see some members have submitted some ho...
11:24 PM Jun 11th: venkatesh2 commented on The Lucky Draw: hii sowmy call me 9343183441
04:57 PM Jun 11th: kalaiselvant commented on The Lucky Draw: 1. If we start from '2' - 2,3 forms the sequence. 2. If we start from '1' - 1,3 an...
04:08 PM Jun 11th: kalaiselvant commented on The Lucky Draw: I am slightly confused with the output of case 2. The answer seems to be correct, ...
06:42 AM Jun 11th: u2001137 commented on Primes in the GCD table: Is there any issue with testing system? My code is running for a file with 300 tes...
02:45 AM Jun 11th: supercharger commented on Count the squares: For (0,0) (0,1) (0,2) (1,0) (1,2) (2,0)(2,1)(2,2).. I think answer is 2. One squre...
05:13 PM Jun 10th: admin 2 commented on Count the squares: Since a sufficiently high number of solutions have been accepted, we would like to...
CodeChef is a global programming communityCodeChef hosts online programming competitions