LOGIN
  • Register
  • Forgot Password?

Site Navigation

  • PRACTICE
    • Easy
    • Medium
    • Hard
  • COMPETE
    • February Algorithm Challenge
    • January Algorithm Challenge
    • December Algorithm Challenge
    • Campus ReSnackdown
    • Campus Snackdown
  • DISCUSS
    • Wiki
    • Forums
    • Blog
    • Twitter
  • COMMUNITY
    • CodeChef Meetups
    • Campus Chapters
    • Host your Contest
    • User Groups
    • CodeChef TechTalks
  • HELP
    • Frequently Asked Questions
    • FAQ for problem setters
    • Ranks
    • Tutorials
  • ABOUT
    • About CodeChef
    • Team CodeChef
    • Press Room
    • CodeChef Financials
    • CodeChef Sponsorships
    • CEO's Corner
    • About Directi
    • Careers
Home » Compete » November 2009 (Contest X)
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
Help the DJ JX 86 75.6244
Help the judge J6 22 3.9574
Magic Strings J5 33 5.4366
SudokuX J1 48 13.6150
The Best Box J7 244 33.9461
The LCS Problem Revisited J2 67 10.3487

Update:

  • 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

 

Rules:

  • Contest problems will become visible on November 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.

RESULTS:

  • Global
  • India
  • Non-Indian
Fetching successful submissions
Rankings are refreshed every few minutes.

RECENT ACTIVITY:

Fetching recent activity

RECENT COMMENTS

04:53 PM Feb 9th: Jaideep commented on Money Matters: what is the max value it should accept??
04:37 PM Feb 9th: Przemysław Uznański commented on Sorting device: the meaning is that: there are gates, gates have two inputs gates send either m...
02:21 PM Feb 9th: Pankaj commented on Sorting device: what is the meaning of this line? gates which have two inputs and send to output ...
01:52 PM Feb 9th: Pankaj commented on Soccer League: yes  yes  yess........... hurryy.. huh. finally i got it.. Feeling very well a...
01:40 PM Feb 9th: Stephen Merriman commented on Money Matters: Therefore your solution is not correct. You'll need to program something that work...
01:00 PM Feb 9th: Jaideep commented on Money Matters: my solution is correct and also work for upper limit.. i have not used array.. in...
10:32 AM Feb 9th: Siddharth Sarasvati commented on Siddharth Sarasvati's solution to Life, the Universe, and Everything: hmm..thanks!!
06:20 AM Feb 9th: Karim commented on the wiki article Tutorial for Small Factorials: #include<stdio.h>
#include<string>
#include<string.h><...
01:59 AM Feb 9th: Stephen Merriman commented on Play on Words: The problem is solvable. That answers your question.
11:39 PM Feb 8th: Przemysław Uznański commented on Overlapping discs: spoj checker uses scanf to test outputs, so it is really no difference if you outp...
  • 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: