OJ Board

(Advertisement)



2006-12-30 12:00-16:00 UTC @ http://acm.uva.es/contest

Hi, it's us again! We are having our third contest here, and we look forward to all your support!

No very hard algorithms are required in this contest. All you need here is simply a clear mind and some basic knowledge of programming. For example:
- Basics of Data Structures
- Sorting and Searching
- Simple Maths
- Recursion and Backtracking
- Graph Traversing (and maybe simple Shortest Path Algorithms)
- and Elementary Dynamic Programming

The contest will contain six tasks. As in our past contests, the first task will be about fractions. Again, we expect even beginners to be able to solve at least a couple of them within the 4-hour duration.

We invite everyone interested in programming to join our contest. Please also help us to promote this contest!!! Thank you~



"Newbie Problemsetters" (NPS) @ 2006

Hi,

Just to remind all of you that the contest will be held tomorrow.

Internet connection from Hong Kong (that's where we are) is currently slow because of an earthquake in Taiwan several days ago. Let's hope that the situation gets better so that our "real time clarification" won't be delayed...

A lot of Asian countries are suffering from slow net speed because of the earthquake..

.. Is there any chance you can extend the the duration to say (5 hrs).

This depends on the actual status during the contest. Duration will be extended if we think is needed.

Thank you.

Congratulations to the 11 contestants/teams that solved all 6 tasks in contest time!!

We hope everyone enjoyed the contest, and we would also like to hear your comments~

We receive much less clarification requests than last year, which is good, since that means our tasks were not full of flaws.

Thanks again to all who supported our contest.

Great Contest !!!
A very nice problemset.

When is Newbies contest 4..

sohel wrote:Great Contest !!!
A very nice problemset.

When is Newbies contest 4..

Absolutely Agree, Big PLUS for problemset +

It was a great contest..!
Good problems..
I couldn't solve many, though..