uniolympiads Ελληνικά

GRCPC, SEERC, ICPC: the path and the rules

How a team goes from GRCPC to SEERC, the European Championship and the World Finals, what is allowed in the contest room, where the past problems are, and in which order to learn the algorithms.

Everything on this page comes from the organisers' official pages, linked next to each item. I checked them on 19 November 2026. The rules change every year, so read the source before the contest.

The path, 2026–27 cycle

Step When and where Source
GRCPC (Greece and Cyprus) 24 October 2026. Thessaloniki, Athens, Patras, Ioannina, Kavala, Heraklion, Paphos, and online for the rest of Greece grcpc.upatras.gr
SEERC (Southeastern Europe) 11–13 December 2026. Thessaloniki (University of Macedonia) and Kyiv (Kyiv School of Economics) seerc.euc.icpc.global
EUC (European Championship) 12–14 February 2027, Eindhoven University of Technology euc.icpc.global
World Finals The official page says "2026 ICPC World Finals Dubai", 4–9 April 2027 wf.icpc.global

I found no official statement of which qualification cycle the Dubai World Finals belong to. Check on icpc.global.

From GRCPC to SEERC

From the official GRCPC rules:

  • The number of Greek teams that advance to SEERC is not known before the contest. The SEERC committee sets it.
  • The top team of each institution advances automatically, provided it has solved at least one problem.
  • The remaining slots go in order of the overall standings.
  • No institution sends more than 3 teams.
  • A team with fewer than two members present does not advance.
  • All electronic devices are banned. If a device is found on a contestant, the whole team is disqualified.

The GRCPC information page summarises the format:

  • teams of exactly 3 students from the same university;
  • one computer with no internet;
  • languages Python, Java, C/C++;
  • 8–14 problems in 5 hours.

On notes, the same page says "30 page notes per team member". The PDF rules do not mention notes, so if this matters to you, ask the organisers.

At SEERC

SEERC follows the ICPC Regional and World Finals rules. The 2026 local rules (version 2.0, September 2026) add the following:

  • Team Reference Document (TRD): the only source of pre-written code in the room.
    • Up to 25 single-sided A4 or Letter pages.
    • Page numbers top right; university and team name top left.
    • Up to 3 identical copies per team. The team prints them and hands them in at registration.
  • Dictionary: one printed bilingual dictionary per contestant, unannotated.
  • Devices: no electronic devices in the room, not even a digital watch.
  • No-shows: a team that does not attend without a documented reason, or without notifying 7 days in advance, is excluded from the next year's SEERC.

The site's templates are short and dependency-free, so they can go into a TRD as they are.

From SEERC to EUC and the World Finals

From the EUC 2026 rules. Their page labels them a draft; I have not checked the EUC 2027 rules.

  • Each of the four European regions gets 25% of the EUC slots.
  • The best teams of each regional advance, one per university.
  • The top two teams from different institutions in each region qualify directly for the World Finals.
  • A further 8 World Finals slots are allocated at the EUC.
  • The format is 3 people, one computer, 5 hours. Languages: Java, Kotlin, Python 3, C, C++.

Who is eligible. The EUC defers to the ICPC Regional Rules. The limits (year studies began, birth year, previous participations) change every year, and I could not read their current version: the page icpc.global/regionals/rules only loads with JavaScript. Don't take them from old diagrams.

Scoring

The scoring rules are common to all of ICPC. Since I could not read the rules page directly, I give no numbers for penalties here. Teams are ranked first by the number of problems solved, then by total time. Rejected submissions on a problem that is eventually solved add a penalty.

Past problems, from the organisers

Contest Problems Solutions / results
GRCPC 2026 Codeforces Gym 106782 editorial · Greece standings
GRCPC 2025 Codeforces Gym 106151 editorial · results
GRCPC 2024 Codeforces Gym 105453 editorial · results
GRCPC 2023 statements (PDF) results
SEERC 2025 statements (PDF) editorial · scoreboard
World Finals past problems

The problem sets stay with the organisers. This page only links to them.

In which order to learn the algorithms

The levels are indicative. Each level assumes the previous ones.

Level What Pages
0 Basics: complexity, sorting, sums, binary search Prefix sums · Binary search · LIS
1 Graphs: traversal, shortest paths, DAGs BFS · Dijkstra · Topological sort · DSU
2 Range data structures Fenwick · Segment tree · Sparse table · MST
3 Maths and strings Modular · Sieve · KMP · Z-function · Hashing
4 Advanced graphs SCC · LCA · Max flow
5 What separates teams at SEERC and EUC: bitmask and tree DP, geometry, FFT, advanced data structures No pages on the site yet. See the editorials above

How a team trains

  1. Individually: one level at a time. Write each algorithm from memory and submit it on CSES.
  2. As a team, once a week: one past GRCPC or SEERC under contest conditions. Five hours, one computer, only your TRD. Codeforces Gym has virtual participation with the contest's own clock.
  3. After each mock contest: read the editorial for whatever you did not solve, and add to your TRD whatever you were missing.
  4. Split roles: who reads all the problems first, who types, who checks. With one computer, keyboard time is the resource that runs out first.