CodeChef: June 2009 (Contest IV)
Site under maintenance
  • Register
  • Forgot Password?
  • PRACTICE
    • Easy
    • Medium
    • Hard
  • COMPETE
    • August Mini Challenge
    • August Algorithm Challenge
    • July Algorithm Challenge
    • June Algorithm Challenge
    • May Gamers Challenge
  • DISCUSS
    • Forums
    • Blog
    • Twitter
  • COMMUNITY
    • CodeChef TechTalks
    • CodeChef Meetups
    • Campus Chapters
    • Host Your Contest
    • User Groups
  • HELP
    • Frequently Asked Questions
    • FAQ for Problem Setters
    • Tutorial: Paying Up
    • Tutorial: Small Factorials
    • Tutorial: Input and Output(I/O)
    • Tutorial: Your First Non-Trivial Problem
  • ABOUT
    • About CodeChef
    • About Directi
    • CEO's Corner
    • Press Room
    • Careers

Home » Compete » June 2009 (Contest IV)

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

RESULTS:

  • Global
  • India
  • US
Loading Rankings...

Rankings are refreshed every few minutes.

RECENT ACTIVITY:

Loading Recent Activity...
  • About CodeChef
  • About Directi
  • CEO's Corner
  • Careers
  • feedback@codechef.com

© 2009 Directi Group. All Rights Reserved. CodeChef uses SPOJ © by Sphere Research Labs

Sponsors
The time now is: