Online judge manual

The online training system is a tool to help you improve your programing skills. It is open to everyone, and obviously free. What follows is a guide to understand its principles and get the most out of it.

Problems

The problems given during the previous editions of the Prologin contest are archived and available on this website. You can train with the problems of the qualification and regional event problems of the previous years. They are ordered by year and difficulty: from beginner to advanced.

Evaluation

The exercises are evaluated by our server: your program is compiled then tested automatically. It is executed once per test. The possible errors are:

If there is a compilation error, the error output of the compiler is shown.

The output produced by your program has to match exactly with the format given in the subjects. The correction system compares the output with a reference output, character by character.

After the tests have been executed, a summary is shown, indicating which tests succeeded and which tests failed. The output of your program and the output given by the correction system is shown only for the first failed test. The exercise will only be considered solved when all the tests succeed.

The correction can take up to several minutes, so be patient.

Score

The training system grades your submissions. Every solved exercise gives you a number of points that depends of the level of the problem and the number of failed attempts you tried. You should test your program yourself before submitting it.

Code stubs

For some languages, we provide code stubs that can "parse" correctly the data given in the standard input of the program. You only need to write the content of a stub function that takes these parsed data in parameter. Note that it is absolutely not mandatory to use these stubs, although they can be really useful most of the time.

Correction system

Time and memory limitations

Every problem enforces some limits in terms of memory usage and execution time. Some coefficients are applied on some slower or memory greedy languages. No particular limitation is applied on the stack size.

Hardware architecture

Your programs are executed in a virtual machine with an Intel(R) Xeon(R) CPU E3-1241 v3 with a clock rate of 3.50 Ghz and an x86_64 architecture. The byte order is Little Endian. The virtual machine has 1 dedicated vCPU and 3 Gio of dedicated random access memory.

Compilers and interpreters

Language Binary Version Options
Ada gnatmake 8.2.1 -f
C gcc 8.2.1 -std=c11 -Wall -Wextra -O2 -lm
C# mcs 5.16.0.0 -optimize+
mono 5.16.0
C++ g++ 8.2.1 -std=c++17 -Wall -Wextra -O2
D dmd 2.084.0
Go go 1.11.5 build -buildmode=exe
Haskell ghc 8.6.3 -dynamic -O2
Java java 1.8.0
javac 1.8.0 -encoding UTF-8
javap 1.8.0
Javascript node 11.9.0
Lua lua 5.3.5
OCaml ocamlopt 4.07.1 -w A
Pascal fpc 3.0.4 -XD -Fainitc
Perl perl 5.28.1
PHP php 7.3.2
Python python3 3.7.2 -S
Ruby ruby 2.6.1
Rust rustc 1.32.0 -W warnings -O
Scheme gsi 4.9.2