Organizers: Advanced Digital Broadcast, University of Warsaw
Sponsors: Google, OFEK

What is this contest?
Algorithmic Engagements is the biggest Polish programming contest with about 2000 competitors every year. It consists of 6 online elimination rounds, after which top 20 contestants advance to an onsite final, held in Zielona Góra or Warsaw, Poland.

This year we’ve decided to hold an online, open contest in parallel to the onsite finals.

Who organizes the contest?
Algorithmic Engagements is organized by Advanced Digital Broadcast and University of Warsaw. We’re sponsored by Google and OFEK. In our team, we have: students, PhD students and professors from University of Warsaw, ACM-ICPC world finals participants, IOI gold medalists, TopCoder targets, ACM-ICPC world finals 2012 organizers and the current leader of UVA Online Judge ranklist.

What does the contest look like?
See Rules & Regulations.

Who can take part in the contest?
Everyone except for jury members. Go ahead and register at the contest site.

Who would I compete with?
Anyone who registers. You can meet some fellow participants on our forum.

Who takes part in the onsite finals?
We have 21 finalists: Tomasz Kociumaka, Jakub Pachocki, Marek Cygan, Marcin Dublański, Krzysztof Magiera, Jakub Wojtaszczyk, Jarosław Gomułka, Jan Hązła, Maciej Wawro, Marcin Skotniczny, Grzegorz Guśpiel, Dawid Dąbrowski, Mateusz Litwin, Bolesław Kulbabiński, Łukasz Kalinowski, Paweł Parys, Bartosz Dąbrowski, Wojciech Bukowicki, Damian Rusak, Damian Straszak, Jacek Jurewicz, since there was a draw at the 20th place. Congratulations!

contest logo
In Short Words:
  • AE 2011 is a 5-hour individual online contest
  • we use ACM ICPC-style grading
  • there are 5-10 problems of algorithmic nature
  • available programming languages: C, C++, Pascal, Java
Important Technical Details:
  1. Programs are graded under 32-bit Linux.
  2. Input data must be read from standard input. Output data must be written to standard output.
  3. Input data adheres exactly to the format described in the problem statement. All numbers written in a single line are separated by single spaces, with no auxiliary spaces. Each line ends with a Linux end-of-line character. For output data same rules apply.
  4. C/C++ programs are compiled using GCC 4.4.1 with O2 optimization. Pascal programs are compiled using FPC 2.2.2 with O2 optimization. Java programs are compiled using Sun JDK v. 1.6.0_02. For Java programs, the class name must be equal to the 3-letter code given in the problem statement.
  5. Time limits are not disclosed during the contest. They can be different for different test cases. The memory limits (common for all test cases) are specified in the problem statements. There is no separate stack limit.
ACM ICPC-style Contest Rules:
  1. Contestants’ solutions are graded on-line, and the contestants are reported of the result of grading. There are several test cases for each problem. A solution must pass all the test cases (fit within the time and memory limit and produce a correct output) for each test case to be accepted.
  2. The result of grading may be one of the following: accepted, compile error, runtime error (includes memory limit exceeded), time limit exceeded, wrong answer or ignored (a solution for this problem was previously accepted). If a solution is not accepted, the contestant may resubmit it as many times as she likes.
  3. Each submission is executed once for each test case (one input file). If it does not pass all the test cases, the result from the first test case that was not passed is reported.
  4. A ranklist is displayed during the whole contest. The contestants are ordered according to the number of problems solved. In case of a draw, they are ordered according to the total time of solving the problems, which is computed only for problems solved by the contestant. The solving time for a given problem is the time elapsed from the start of the contest to the moment an accepted solution was given by the contestant, increased by 20 minutes of penalty for each incorrect solution submitted prior to the accepted solution.
Technical Regulations:
  1. Solutions are compiled using the following commands:
    • gcc -O2 -static abc.c -lm for C
    • g++ -O2 -static abc.cpp -lm for C++
    • ppc386 -O2 -XS -Xt abc.pas for Pascal
    • javac for Java
  2. Java solutions are executed under a virtual machine using the following command:
    • java -Xmx<memory limit> -Xms<memory limit> -Xss<memory limit>
  3. Programming language is inferred from the file extension: .c for C, .cpp for C++, .pas for Pascal, .java for Java.
  4. No submitted program may exceed 100 kB in size. The size of the compiled program must not exceed 5 MB. Maximum compilation time is 30 seconds.
  5. Solutions must finish execution with runtime code 0, other runtime codes are treated as runtime error.
  6. Inline assembly is not allowed.
  7. Submitted solutions are not allowed to:
    • use external libraries (e.g., crt, graph in Pascal);
    • access the network;
    • fork;
    • open and create files;
    • attack the system security or the grader;
    • execute other programs;
    • change file system permissions;
    • read file system information;
    • make system calls not related to solving the competition task.
Haven’t found what you are looking for? You can ask us a question via the contest site. This can also be useful if anything in the contest tasks is unclear.
contest logo

Task archive

A good deal of tasks from previous editions is available at To get a flavour of what the tasks might be like, check the tasks from final rounds of several most recent editions of the contest.

What are the other rounds? Well, this contest takes place annually in Poland and starts with online elimination rounds, each of which lasts from one to three days. There are two divisions. Division B contains easy/medium/hard problems, whereas division A - medium/hard/killer tasks. The first rounds are rather easy. If you prefer something really challenging, try tasks from the fifth round (which lasts for three days). The top 20 contestants from the overall ranklist advance to an onsite final, which, this year, takes place on November 26th in Warsaw, Poland. You can join us and participate online!

contest logo