Editing Informatics olympiad
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
| Latest revision | Your text | ||
| Line 2: | Line 2: | ||
* A small number of problems (usually between 3 and 6), usually equally weighted | * A small number of problems (usually between 3 and 6), usually equally weighted | ||
* Total competition time limit of a few hours within which to submit solutions | * Total competition time limit of a few hours within which to submit solutions | ||
| − | * Restricted set of programming languages and programming language implementations are allowed for solutions (C and C++ | + | * Restricted set of programming languages and programming language implementations are allowed for solutions (C and C++ always allowed, Pascal and Java often allowed, other languages usually not allowed); solution to a given problem must consist of a single source file which uses only built-in libraries |
* Algorithmic problem style: problems are difficult because they must be solved by efficient algorithms, rather than other engineering-related concerns such as user interface design | * Algorithmic problem style: problems are difficult because they must be solved by efficient algorithms, rather than other engineering-related concerns such as user interface design | ||
* Black-box, automated testing: competitors' solutions are compiled and run against secret test data. A solution receives points for a test case if and only if it produces the correct output for given input within stated time and memory limits. No points are awarded for style. | * Black-box, automated testing: competitors' solutions are compiled and run against secret test data. A solution receives points for a test case if and only if it produces the correct output for given input within stated time and memory limits. No points are awarded for style. | ||
| Line 8: | Line 8: | ||
* Contestants compete individually and are graded in isolation from others. | * Contestants compete individually and are graded in isolation from others. | ||
Examples of OIs include the following: | Examples of OIs include the following: | ||
| − | * | + | * Asia-Pacific Informatics Olympiad (APIO) |
| − | + | ||
* Baltic Olympiad in Informatics (BOI) | * Baltic Olympiad in Informatics (BOI) | ||
* Bulgarian Olympiad in Informatics (BOI) | * Bulgarian Olympiad in Informatics (BOI) | ||
* [[Canadian Computing Competition]] (CCC) | * [[Canadian Computing Competition]] (CCC) | ||
* Croatian Olympiad in Informatics (COI) | * Croatian Olympiad in Informatics (COI) | ||
| + | * [[International Olympiad in Informatics]] (IOI) | ||
* Polish Olympiad in Informatics (POI) | * Polish Olympiad in Informatics (POI) | ||
* USA Computing Olympiad (USACO) | * USA Computing Olympiad (USACO) | ||
| − | |||
| − | |||
Many of the national OIs serve as ''team selection tests'', that is, they are used to select students to represent the country at the IOI. For this reason, OIs are generally only open to participation by primary and secondary school students. | Many of the national OIs serve as ''team selection tests'', that is, they are used to select students to represent the country at the IOI. For this reason, OIs are generally only open to participation by primary and secondary school students. | ||
| − | The informatics olympiads are among the most prestigious programming competitions, along with | + | The informatics olympiads are among the most prestigious programming competitions, along with [[ACM programming competition]]s. Strong performance in OIs often helps students gain admission to selective post-secondary institutions, scholarships, and internships with selective software companies. |
