International Olympiad in Informatics

From Wikipedia, the free encyclopedia

The International Olympiad in Informatics (IOI) is an annual informatics competition for secondary school students. The first IOI was held in 1989.

The contest consists of two days computer programming, solving problems of an algorithmic nature. Students compete on an individual basis, with up to four students competing from each participating country (with around 81 countries in 2004). Students are selected through national computing contests. For example, in Britain, students compete in the BIO for a place in the national team.

Contents

On each of the two competition days, the students are typically given three problems which they have to solve in five hours. Each student works on his/her own, with only a computer and no other help allowed, specifically no communication with other contestants, books etc. Usually to solve a task the contestant has to write a computer program (in C, C++ or Pascal) and submit it before the five hour competition time ends. Later on, the program is graded by being run with secret test data, consisting of multiple (typically 10 or 20) test cases. The contestant is awarded points for each test case that his program solves correctly, and within the given time and memory limit. In some cases, the contestant's program has to interact with a secret computer library, which allows problems where the input is not fixed, but depends on the program's actions - for example in game problems. Another new type of problems has known inputs which are publicly available already during the five hours of the contest. For these, the contestants have to submit the according output file instead of a program, and it is up to them whether they obtain the output files by writing a program (possibly exploiting special characteristics of the input), or by hand, or by a combination of these means.

The scores from the two competition days and all problems are summed up separately for each contestant. At the awarding ceremony, contestants are awarded medals depending on their relative total score. The top 50% of the contestants (i.e. two per country, on average) are awarded medals, such that the relative number of gold : silver : bronze : no medal is approximately 1:2:3:6 (thus 1/12 contestants get a gold medal).

The competition room at the IOI 2006
The competition room at the IOI 2006

Unlike other science olympiads the IOI regulations specifically prohibit ranking by countries. Although several countries apply their own algorithms for country ranking there is therefore no standard.

  1. Filip Wolski (Poland)
  2. Jae Hyun Park (Korea)
  3. Long Fan (China)
  4. Sergey Kopeliovich (Russia)
  5. John Pardon (USA)
  6. Rostislav Milenov Rumenov (Bulgaria)
  7. Mircea Bogdan Pasoi (Romania)
  8. Vladimir Minajlov (Belarus)
  9. Zhū Zéyuán (China)
  10. Ilya Razenshteyn (Russia)
  11. Denis Denisov (Russia)
  12. Nikita Lesnikov (Belarus)
  13. Vahid Liaghat (Iran)
  14. Wang Dong (China)
  15. Christopher Chen (Australia)
  16. Toshiki Kataoka (Japan)
  17. Daniil Neiter (Ukraine)
  18. Jakub Kallas (Poland)
  19. Li Tianyi (China)
  20. Atamurad Hezretkuliev (Turkmenistan)
  21. Masaki Watanabe (Japan)
  22. Marcin Andrychowicz (Poland)
  23. Chi Kit Lam (Hong Kong)
  24. Codrut Miron Grosu (Romania)

Retrieved from "http://en.wikipedia.org/wiki/Talk:International_Olympiad_in_Informatics"

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.