We hope you participated and enjoyed the changes made to monthly Long Contests.
We bring you the CodeChef February 2013 Long Challenge. The February 2013 Algorithm Challenge is taking place on http://www.codechef.com/FEB13.
Here are the details:
Date: 1st February 2013 to 11th February 2013
Duration: 10 days
Problems: 9 binary problems of varying difficaulty levels + 1 challenge problem.
Problem Setters:
- Vinayak Garg (vinayakgarg),
- Vitaliy Herasymiv (witua),
- Roman Rubanenko (Rubanenko),
- Imran Sunny (sunny),
- Kaushik Iska (cauchyk),
- Khadar Basha (monumahiya),
- David Stolp (pieguy),
- Sergey Kulik,
- Bruno Oliveira and
- Shanjingbo
Problem Tester : Hiroto Sekido (laycurse)
Editorialist: Pradeep Mathias (pragrame)
It promises to deliver on an interesting set of algorithmic problems with prizes up for grabs.
The contest is open for all and those, who are interested, are requested to register in order to participate.
Check out the local time in your City/Time Zone here. Do share your feedback on what you feel about the new long contest format at [email protected]
Good Luck! Hope to see you participating.
Cook-off ?
Oops! :( Thanks for pointing it out. Fixed.
How fast is codechef server ? How many operations can I do in 1 sec ?
it is said in FAQ page that chodechef judge is slower than a PC computer that is codechef need 2-3 times of time needed in a PC computer
Could you please post the whole sentence please. I could not found anything in FAQ. Anyway started using Codechef. Very nice. ;) Liked this FEB Long Contest. One thing I found STRANGE was I saw submittions which used up to 1398.5M memory. Is it possible to use 1398.5M of memory ??
You can find it in "Why do I get a Time Limit Exceeded?" section and this is the whole sentence:
_Finally, you may have tested your code on all sorts of large inputs and are sure your code will run inside the time limit. However, Codechef's judge may be slower than your computer. It is common for a program to take 2-3 times as long on Codechef as it does on your computer. The time limits are all attainable, so you will just need to come up with a way of making your algorithm faster. (One possibility in C++ is to avoid using STL, which can be a little slow). _