Announcing the new and improved Lazy yet Competent Internet ProgrammingContest #3!
Yes, the time for contest #3 is at hand, and this time thecontest directors have made some changes due to overwhelmingdemand.
The contest length has been shortened to one week
There will be four problems distributed over a range of algorithmic approaches (not just math problems).
There will be prizes for the winners (certificates, plaques).
There will also be a special challenge round independent of the contest round in which students will be asked to find an approximate answer to a given task in a given amount of time.
So join the LCIPC3 bandwagon and get geared for keyboard-punching, algorithm-choosing, and bug-hunting mania. This is a perfect way to prepare for the CEOI or the IOI.
LCIPC3 will be conducted August 1-7, 1999.
Task descriptions will be sent through hs-computing@delos.com if Rob will permit, and they will also be posted at http://web.wt.net/~photon/lchs/us.htm along with the tasks and results of previous contests.
A query board which will contain all questions or comments asked will also be found at the site.
This is an individual contest for pre-college competitors. Competitors will have five hours to solve the four tasks. The solutions are to be submitted through email and queries will also be submitted through email. Competitors will submit source code to their solutions only. Reference books or materials will be permitted.
There will also be an extra task termed the challenge round in which opponents will write a program to find an approximate answer to a task. Three hours are allowed for this task, but this task is scored independently of the other four tasks.
Solutions will be graded on a Intel Celeron 366MHz machine.
Allowed languages will be Pascal, C, and C++. They will be compiled using Borland Pascal 7.0 and Turbo C++ 3.0.
Until then, if you have any questions or any other suggestions, please mail them to jonmac@stanford.edu, and we will take careful consideration to your concerns.
