Editing Informatics olympiad

Jump to: navigation, search

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++ are always allowed, Pascal, Java and Python are often allowed ( In the IOI the only language allowed is C++ ), other languages usually are not); solution to a given problem must consist of a single source file which uses only built-in libraries
+
* Restricted set of programming languages and programming language implementations are allowed for solutions (C and C++ are always allowed, Pascal, Java and Python are often allowed ( In the IOI the only language allowed in C++ ), other languages usually are not); 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.

Please note that all contributions to PEGWiki are considered to be released under the Attribution 3.0 Unported (see PEGWiki:Copyrights for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource. Do not submit copyrighted work without permission!

Cancel | Editing help (opens in new window)