Results for 2009 | FAQ | Contest Rules | Language Templates | Sample Problems | Past Results | Training Site | Other Activities
Results for 2009 are online!
Teachers and Students: Results for the 2009 Australian Informatics Olympiad are now available! You may follow the link above to the AIO submission site, where you can log in and view detailed results for your each of your submissions. Please use the same username and password that you were given during the contest.
We recommend that you try this, since the online results contain more detail than the final mailouts to schools (each score is broken down test case by test case, and you can see which cases were correct, incorrect, timed out and so on).
Mailouts and certificates will be posted to schools in due course. Please mail aioquery@amt.edu.au if you are having trouble logging in, or if you have any other questions.
Students: Sample solutions from the 2003 competition in all of the supported AIO languages are provided below. You may also wish to take a look at the online training site, where you can practise past AIO problems and sharpen your skills!
The Australian Informatics Olympiad (AIO) is a computer programming competition that is held annually in early September. From 1998 until 2004 it was called the Australian Informatics Competition (AIC). In 2005 it was renamed the Australian Informatics Olympiad, with the AIC becoming a pencil-and-paper competition that you can read more about here.
A list of questions and answers can be found on the AIO information page at the Australian Mathematics Trust.
If you have any queries on how to enter, you are welcome to phone the Trust at (02) 6201 5137. If you have technical questions about the competition, please write to aioquery@amt.edu.au.
Each student should receive a printed copy of the contest rules [PDF]. Students and teachers should familiarise themselves with these before the contest.
Language Templates (new in 2009)
In previous AIOs, we have seen many students who could solve the algorithmic part of tasks but would score no marks due to having little experience with file input and output. In 2009, students are provided with template code for each problem in each supported language. These templates will provide the skeleton of a program to perform the necessary I/O to read the input files and write to output files in the correct format. They will not solve the problem but may be used as a starting point by the student.
Students may download these templates when the competition begins by logging into the the competition site. Note that these templates are entirely optional. The student may wish to disregard the templates or modify them in any way they wish.
The table below lists some sample problems from the 2003 competition, along with sample solutions in most of the supported programming languages. You may also wish to take a look at the online training site, where you can view problems from every past competition and submit your own solutions for on-the-spot judging! Please note that, although the training site only accepts C, C++ and Pascal solutions, other languages such as PHP, Python, Java and Visual Basic are also allowed in the AIO.
| Problem | Sample Solutions | Score |
|---|---|---|
| Culture | C, C++, Pascal, Java, PHP, Python, Visual Basic | 100% |
| Stacking Numbers | C, C++, Pascal, Java, PHP, Python, Visual Basic | 50% (correct but too slow) |
| Zig-Zag Cipher | C, C++, Pascal, Java, PHP, Python, Visual Basic | 100% |
You are of course encouraged to find a solution to Stacking Numbers that is fast enough to score full marks!
Results of previous AIOs (or AICs as the competition was named until 2004) can be found on the AIO results page at the Australian Mathematics Trust.
© Australian Mathematics Trust 2001-2009
Contact: training@magnet.amt.edu.au Web design: Ben Burton, Peter Hawkins, Bernard Blackham and others.