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
NameCodeSuccessful SubmissionAccuracy
Ciel and Ball Guessing GameCIELBALL00
Ciel and MapCIELMAP11620.27
Ciel Numbers IIICIELNUM311.49
Ciel and ReceiptCIELRCPT92861.88
Ciel and TomyaCIELTOMY22918.14

 

The July Cook-off has ended.

The editorials for the contest can be found here.

The Winners blog will be updated soon.

All the solutions for the problem set are public and the problems have been moved to practice section.

 

 

In case you are a new user, you will need to first register for a CodeChef ID here.

  • Please do not discuss strategy, suggestions or tips in the comments during a live contest. Posting questions clarifying the problem statement is ok. Comments will be published only after admin approval during the contest. If you are unsure, email us at feedback@codechef.com

    •
  • You can also send in your queries in an email to contest-admin@codechef.com, during the contest.

    •
  • Contest problems will become visible on July 22nd, 2012 at 21:30 (IST). There will be 5 problems in all. Check your timezone here.

    •
  • 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.

    •
  • Users are ranked according to the most problems solved. Ties will be broken by the total time for each user in ascending order of time.

    •
  • The total time is the sum of the time consumed for each problem solved. The time consumed for a solved problem is the time elapsed from the beginning of the contest to the submittal of the first accepted run plus 20 penalty minutes for every previously rejected run for that problem. There is no time consumed for a problem that is not solved.

Announcements

22/07/2012, 21:40, IST: The ranking for the contest can be found here.

22/07/2012, 22:10, IST: The problem statements for CIELMAP and CIELTOMY have been changed. Please read the updated statements before making your submissions.

CONTEST ENDED.

RECENT ACTIVITY


Fetching recent activity

RECENT COMMENTS

    


	

		

							12:12 AM Jul 23rd:
							phantom11 commented on Ciel and Tomya: @hirito_adm: you should have given at least one test case which would fail coz of ...
					   

							11:41 PM Jul 22nd:
							hiroto_adm commented on Ciel and Tomya: @ridder Yes. Every roads are two-way roads.
					   

							11:38 PM Jul 22nd:
							ridder commented on Ciel and Tomya: @admin-can there be path from Ai to Bi as well as Bi to Ai
					   

							11:34 PM Jul 22nd:
							hiroto_adm commented on Ciel and Tomya: @sikander_nsit The order of roads is arbitrary. You can not assume the roads are s...
					   

							11:31 PM Jul 22nd:
							sikander_nsit commented on Ciel and Tomya: roads would be given in some order or its random like the first road is from n-1 t...
					   

							11:31 PM Jul 22nd:
							hiroto_adm commented on Ciel and Tomya: @m1a9313 Yes. M can be at most N(N-1)/2, it means there are edges in every pair of...
					   

							11:28 PM Jul 22nd:
							hiroto_adm commented on Ciel and Map: @phantom11 You can assume there is at least one valid tetragon.
					   

							11:26 PM Jul 22nd:
							m1a9313 commented on Ciel and Tomya: is it possible to have 4 intersections with 6 roads
					   

							11:25 PM Jul 22nd:
							phantom11 commented on Ciel and Map: What should be the answer if there are no valid tetragon??
					   

							11:15 PM Jul 22nd:
							hiroto_adm commented on Ciel and Tomya: @sikander_nsit possible. It is a valid test case.