FAQ | Sample Problems | Past Results | Training Site | Other Activities
The 2008 Australian Informatics Olympiad will be held on Thursday, 4 September 2008.
Teachers: You will able to register your school and students with the online submission site from Monday, 25 August 2008. Before registering online, please ensure you have mailed in your registration form with the invitation brochure. If you have not received a registration form, email the Trust or phone (02) 6201 5137.
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.
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 Java, Visual Basic are also allowed in the AIO.
| Problem | Sample Solutions | Score |
|---|---|---|
| Culture | C, C++, Pascal, Java, Visual Basic | 100% |
| Stacking Numbers | C, C++, Pascal, Java, Visual Basic | 50% (correct but too slow) |
| Zig-Zag Cipher | C, C++, Pascal, Java, 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-2008
Contact: training@magnet.amt.edu.au Web design: Ben Burton, Peter Hawkins, Bernard Blackham and others.