Selection system at WCC-2017

30 most successful participants will receive invitations to participate in the WCC-2017 by the results of each tour among those who solved at least one problem in this round or/and doesn't have a current invitation by the results of any of the preceeding tours. The remaining participants are formed into a wait list sorted in a descending order in connection to the total number of available spots in two rounds, where the participant achieved the highest result.
We guarantee no fewer than 10 participants from the wait list to be invited in the WCC-2017.

Rules of the tour:
During the tour, participants will be given 4-8 problems for solving. The problems can be solved in any order.
Solution checking is provided during the course of the competitions.
What makes up a solution is a program compiled in one of the available programming languages (see the next point). The program shall not contain assist modules and files. Different problems can be solved in a range of different programming languages.

The following compilers are guarateed to be present on the server:

  • GNU C++ (4.9.2)
  • GNU C++0x (4.9.2)
  • GNU C (4.9.2)
  • Java 7 (minimal version: 1.7.0_71)
  • Java 8 (1.8.0_25)
  • Python 2 (2.7.8)
  • Python 3 (minimal version: 3.2.5)
  • Free Pascal (2.6.2)

In all problems, data input and output is performed in standard flows of input and output.

When a problem solution is available, participants send them to the testing system for checking. In order to do this, in the interface participants must select the problem for sending out, the programming language and the source file with the text of the program. After this, the participant will continue to work on other problems. Upon reception of the solution, the system compiles the programme using compilers of the command line and checks them based on the preliminary prepared set of tests.

Once the system completes checking the solution, the participant will receive a message with the testing results. This message is displayed on the screen. If no compiling error occurs, then it reports either that the problem passed the checking or a message with specification of the mistake in the first improperly solved test.
The problem is considered solved once it has passed all tests. Partial solutions that didn't pass all tests are not marked.

Problem solutions should not:

  • perform any actions with files or catalogues
  • use any network means
  • use any other available means or perform actions that can jeopardize the process of checking and passing the tour.

A solution should display the same results on the same test without regard to the launch time and programming environment. Judges are entitled to perform an unlimited number of recurrent tests of the programme and select the worst results for each of the tests.

Appeals are not viewed.
Judges are entitled to defining the level of correctness for passing the tests, marking, selection of winners and disqualification of participants. Judges solve any matters that occur in relation to any unforeseen circumstances or events. Judges' decisions are ultimate and are not subject to appeals.

System of marking for solutions of the selection rounds (ACM rules):
A participant who solved the most problems receives a higher rating score in the scoreboard.
In case of an even result of solved problems, the highest score is assigned to the participant who has the least total penalty time.
Penalty time is calculated the following way: for solved problems, the penalty time is made up of minutes of time since the beginning of the tour until sending the problem for checking, plus 20 penalty minutes for each unsuccessful attempt to send out the problem. Penalty time is not assigned for unsolved problems.

Participants who solve an even number of problems and have an even aggregate penalty time, the position becomes shared. If at least one participant out of a group of participants who share the same position gains an invitation to the WCC-2017, the remaining participants also receive invitations.

Share page: