LOGIN
  • Register
  • Forgot Password?

Site Navigation

  • PRACTICE
    • Easy
    • Medium
    • Hard
  • COMPETE
    • March Algorithm Challenge
    • February Algorithm Challenge
    • January Algorithm Challenge
    • December Algorithm Challenge
  • DISCUSS
    • Wiki
    • Forums
    • Blog
    • Twitter
  • COMMUNITY
    • CodeChef Meetups
    • Campus Chapters
    • Host your Contest
    • User Groups
    • CodeChef TechTalks
    • All Educational Initiatives
  • 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 » January 2010 (Contest XII)
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:

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

RECENT ACTIVITY:

Fetching recent activity

RECENT COMMENTS

07:28 AM Mar 12th: pangsit commented on ATM: @Nitin Kumar, I got this problem too when I choose C++ (g++ 4.3.2). I managed to s...
02:45 AM Mar 12th: Enrique commented on ATM: @Stephen, do you think that a Bank will let you do any transaction you want withou...
02:28 AM Mar 12th: Ankit Malpani commented on Missile Problem: yes... i agree with ankit on that one...kindly verify the sampel output for 1st ca...
02:19 AM Mar 12th: ankit agarwal commented on Missile Problem: check out the 1st case admin....it should give no!!!
02:02 AM Mar 12th: Stephen Merriman commented on the wiki article Tutorial for Input,Output: No it isn't.
02:01 AM Mar 12th: Stephen Merriman commented on double_s's solution to Stone Game: That is not a valid move according to the problem statement.
02:00 AM Mar 12th: Rohit Kumar gupta commented on Destroy the Enemy: can anyone explain the test cases, please...
01:51 AM Mar 12th: soc commented on Missile Problem: what is the positoin of target??????????? its not clear from problem statement...
01:29 AM Mar 12th: Aman commented on Missile Problem: @Lucky: Whole line is the fire line. A and B are the just the points on the fire l...
01:15 AM Mar 12th: Aman commented on Destroy the Enemy: @Mahesh Chandra Sharma:x1,x2...xi....xn are the assumed x co-ordinates
  • 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: