NCPC 2025

In short: Teams of up to three persons try to solve as many problems as possible, without external help.

The rules for this contest is given by the ICPC regional contest rules, with the following clarifications and additions:

Who may compete

The teams competing consist of up to three persons. The competition is open to everybody, as long as they are either a citizen of the NCPC countries or related to an entity (company or university) in the NCPC countries. Every team must compete for some NCPC country.

ICPC eligibility

Teams consisting of university students, who are ICPC eligible, are encouraged to participate in the ICPC division. These may qualify for the regional finals (NWERC), and further to the ICPC World Finals. Basically, any student born in 2002 or later, or who started their university/college studies in 2021 or later is eligible to compete. For exceptions such as retaken years, military service and so on, please refer to the ICPC rules. Persons who have competed in five regional finals already, or two world finals, may not compete in the ICPC division, however there are some exceptions for the covid years.

How and where you may compete

• The contest is held at the participating sites.
• All members of a team have to be present at the same site.
• Your team may bring a single personal computer (with one keyboard, one mouse and one screen) to use during the competition.
• You may NOT use any additional electronic devices (such as mobile phones) to compete.
• You may bring printed material (such as books).

What you may and may not do during the contest

• You may NOT use the internet for anything other than accessing the contest page and documentation.
• You may NOT use a program using generative AI, such as Github Copilot or ChatGPT.
• You may use prewritten code, and other software available on your computer that doesn’t break the previous two rules.
• You may NOT communicate with anyone other than the contest organizers and your own team members.

The contest

The problem set consists of a number of problems (usually 8-12). The problem set will be in English, and given to the participating teams when the contest begins. For each of these problems, you are to write a program in any of the programming languages supported by the Kattis system (see here for a list). The jury guarantees that each problem is solvable in C++ and Java. No guarantees for other languages are given due to the large number of allowed languages, however the jury guarantees that for every language there is at least one problem solvable in that language (it has always been the case that several of the problems were solvable in all available languages, but there is no guarantee of this).

The submitted programs must read from standard input (stdin) and write to standard output (stdout), unless otherwise stated. After you have written a solution, you may submit it using the specified submission system.

The team that solves the most problems correctly wins. If two teams solve the same number of problems, the one with the lowest total time wins. If two top teams end up with the same number of problems solved and the same total time, then the team with the lowest time on a single problem is ranked higher. If two teams solve the same number of problems, with the same total time, and the same time on all problems, it is a draw. The time for a given problem is the time from the beginning of the contest to the time when the first correct solution was submitted, plus 20 minutes for each incorrect submission of that problem. The total time is the sum of the times for all solved problems, meaning you will not get extra time for a problem you never submit a correct solution to.

If you feel that a problem definition is ambiguous, you may submit a clarification request via the submission system. If the judges think there is no ambiguity, you will get a short answer stating this. Otherwise, the judges will write a clarification, that will be sent to all teams at all sites in the contest.

---

Change-log

• 2025-03-08 initial publication.