IBM logo

ICPC main sponsor worldwide

DF logo

Swedish sponsor
Microsoft logo

Norwegian sponsor
Trolltech logo

Norwegian sponsor

NCPC 2005

1st October 11:00-16:00 CEST


Result and problem set
Participating sites
Rules

Back to main NCPC page
a part of
ICPC logo

Results and problem set

top

The contest was held Saturday October 1st. The winner of the Nordic contest was Lag Bernhardsson from The Royal Institute of Technology in Stockholm, with eight out of nine problems solved. They are now also Swedish champions. Second was Team Interam÷ba from Lund Institute of Technology with 6 problems solved. Third was Black Gold from The University of Oslo with 5 problems solved, making them Norwegian champions.

Participating sites

top

Below are links to local information about the contest. Smaller sites might not set up a web-page. The organisers will then inform you in other ways:

Rules

top

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

Who may compete

Note: The old “grandfather” rule is no longer effective. This means that there is no limit on the number of 4th/5th-graders on a team.

Basically, any student who started his/her university/college studies in 2001 or later is eligible to compete. For exceptions such as retaken years, military service and so on, please see the ICPC regional contest rules. Those who have competed in five regional finals (NWERC) already, or two world finals, may not compete.

What you may bring to the contest floor

  • Any written material (Books, manuals, handwritten notes, printed notes, etc).
  • Pens, pencils, blank paper, stapler and other useful non-electronic office equipment.
  • NO material in electronic form (CDs, USB pen and so on).
  • NO electronic devices (Cellular phone, PDA and so on).

Behaviour during the contest

Contestants are only allowed to communicate with members of their own team, and the organisers of the contest. The only electronic equipment they can use is their assigned team computer. The only remote electronic content they may access is what is made available by the local organiser, such as programming language APIs and compiler manuals. This means the only network traffic the contestants may generate is from the use of PC^2 for submitting their problem solutions, and access to web-pages specified by the local organisers. This means you may not read your e-mail or chat with your aunt on MSN.

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 C, C++ or Java that reads from standard input (stdin) and writes to standard output (stdout), unless otherwise stated. After you have written a solution, you may submit it using the PC^2 system. See the PC^2 Contestants Guide for details.

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 problem definition is ambiguous, you may submit a clarification request via the PC^2 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.



Editor: Nils Grimsmo