| Swiss Subregional 2025-2026 |
|---|
| Finished |
→ About Contest
The contest was used as a team selection contest in ETH Zürich and other Swiss universities.
→ Virtual participation
Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.
→ Practice?
Want to solve the contest problems after the official contest ends? Just register for practice and you will be able to submit solutions.
→ Status filter
→ Contest materials
Contest status
| # | When | Who | Problem | Lang | Verdict | Time | Memory |
|---|---|---|---|---|---|---|---|
| 347600909 | Nov/05/2025 21:59 |
 Robin Koppelhuber |
J - Good Pairs in Graph and Tree | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600908 | Nov/05/2025 21:59 |
Alessio Barletta |
D - Building A Smooth Playlist | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600907 | Nov/05/2025 21:59 |
George King |
J - Good Pairs in Graph and Tree | Unknown | Accepted | 0 ms | 0 KB |
| 347600906 | Nov/05/2025 21:59 |
Janis Waser |
J - Good Pairs in Graph and Tree | Unknown | Memory limit exceeded | 0 ms | 0 KB |
| 347600905 | Nov/05/2025 21:59 |
Victor Zablocki |
J - Good Pairs in Graph and Tree | Unknown | Accepted | 0 ms | 0 KB |
| 347600904 | Nov/05/2025 21:59 |
Pabl Landrove |
J - Good Pairs in Graph and Tree | Unknown | Accepted | 0 ms | 0 KB |
| 347600903 | Nov/05/2025 21:59 |
Pabl Landrove |
J - Good Pairs in Graph and Tree | Unknown | Compilation error | 0 ms | 0 KB |
| 347600902 | Nov/05/2025 21:59 |
Joris Belder |
J - Good Pairs in Graph and Tree | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600901 | Nov/05/2025 21:59 |
Moritz Schwalm |
J - Good Pairs in Graph and Tree | Unknown | Accepted | 0 ms | 0 KB |
| 347600899 | Nov/05/2025 21:59 |
George King |
J - Good Pairs in Graph and Tree | Unknown | Runtime error | 0 ms | 0 KB |
| 347600898 | Nov/05/2025 21:59 |
Théo Hollender |
A - Rainbow | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600897 | Nov/05/2025 21:59 |
George King |
J - Good Pairs in Graph and Tree | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600896 | Nov/05/2025 21:59 |
Pabl Landrove |
J - Good Pairs in Graph and Tree | Unknown | Memory limit exceeded | 0 ms | 0 KB |
| 347600895 | Nov/05/2025 21:59 |
Victor Zablocki |
J - Good Pairs in Graph and Tree | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600894 | Nov/05/2025 21:59 |
Ryan Mehenni |
E - Counting VIP Guests | Unknown | Accepted | 0 ms | 0 KB |
| 347600893 | Nov/05/2025 21:59 |
Carlo Collodel |
D - Building A Smooth Playlist | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600892 | Nov/05/2025 21:59 |
Moritz Schwalm |
J - Good Pairs in Graph and Tree | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600891 | Nov/05/2025 21:59 |
Tudor Musat |
K - Hyperscale AI Data Center | Unknown | Accepted | 0 ms | 0 KB |
| 347600890 | Nov/05/2025 21:59 |
Julian Weide |
J - Good Pairs in Graph and Tree | Unknown | Accepted | 0 ms | 0 KB |
| 347600889 | Nov/05/2025 21:59 |
Tudor Musat |
K - Hyperscale AI Data Center | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600888 | Nov/05/2025 21:59 |
Jan Rubeš |
D - Building A Smooth Playlist | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600887 | Nov/05/2025 21:59 |
Botu Lyu |
G - Nearest Strings | Unknown | Runtime error | 0 ms | 0 KB |
| 347600886 | Nov/05/2025 21:59 |
Joris Belder |
J - Good Pairs in Graph and Tree | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600885 | Nov/05/2025 21:59 |
Botu Lyu |
G - Nearest Strings | Unknown | Memory limit exceeded | 0 ms | 0 KB |
| 347600884 | Nov/05/2025 21:59 |
Wiktoria Rozkosz |
D - Building A Smooth Playlist | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600883 | Nov/05/2025 21:59 |
Botu Lyu |
G - Nearest Strings | Unknown | Memory limit exceeded | 0 ms | 0 KB |
| 347600882 | Nov/05/2025 21:59 |
Yaël Arn |
J - Good Pairs in Graph and Tree | Unknown | Accepted | 0 ms | 0 KB |
| 347600881 | Nov/05/2025 21:59 |
Jiri Gebauer |
J - Good Pairs in Graph and Tree | Unknown | Runtime error | 0 ms | 0 KB |
| 347600880 | Nov/05/2025 21:59 |
Yaël Arn |
J - Good Pairs in Graph and Tree | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600879 | Nov/05/2025 21:59 |
Lucca Guerin Saturnino |
D - Building A Smooth Playlist | Unknown | Accepted | 0 ms | 0 KB |
| 347600878 | Nov/05/2025 21:59 |
Ryan Mehenni |
D - Building A Smooth Playlist | Unknown | Accepted | 0 ms | 0 KB |
| 347600877 | Nov/05/2025 21:59 |
Martin Wertich |
D - Building A Smooth Playlist | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600876 | Nov/05/2025 21:59 |
Mathéo Beney |
D - Building A Smooth Playlist | Unknown | Accepted | 0 ms | 0 KB |
| 347600875 | Nov/05/2025 21:59 |
Ondrej Sladký |
G - Nearest Strings | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 347600874 | Nov/05/2025 21:59 |
Zhiyao Yan |
J - Good Pairs in Graph and Tree | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600873 | Nov/05/2025 21:59 |
Lucca Guerin Saturnino |
D - Building A Smooth Playlist | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600872 | Nov/05/2025 21:59 |
Soorya Narayanan |
D - Building A Smooth Playlist | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600871 | Nov/05/2025 21:59 |
Yizhou Xu |
J - Good Pairs in Graph and Tree | Unknown | Accepted | 0 ms | 0 KB |
| 347600870 | Nov/05/2025 21:59 |
Botu Lyu |
G - Nearest Strings | Unknown | Memory limit exceeded | 0 ms | 0 KB |
| 347600869 | Nov/05/2025 21:59 |
Tudor Stefan Pagu |
D - Building A Smooth Playlist | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600868 | Nov/05/2025 21:59 |
Mark Neumann |
C - The Forgetful Magician | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600867 | Nov/05/2025 21:59 |
Jiaheng Li |
K - Hyperscale AI Data Center | Unknown | Accepted | 0 ms | 0 KB |
| 347600866 | Nov/05/2025 21:59 |
Mykhailo Taranik |
G - Nearest Strings | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 347600865 | Nov/05/2025 21:59 |
Daniel Apostol |
D - Building A Smooth Playlist | Unknown | Accepted | 0 ms | 0 KB |
| 347600864 | Nov/05/2025 21:59 |
Gabriele Baietta |
C - The Forgetful Magician | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600863 | Nov/05/2025 21:59 |
Mathéo Beney |
D - Building A Smooth Playlist | Unknown | Wrong answer | 0 ms | 0 KB |
| 347600862 | Nov/05/2025 21:59 |
Mihai Oprea |
C - The Forgetful Magician | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 347600861 | Nov/05/2025 21:59 |
Joris Belder |
J - Good Pairs in Graph and Tree | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 347600860 | Nov/05/2025 21:59 |
Botu Lyu |
G - Nearest Strings | Unknown | Memory limit exceeded | 0 ms | 0 KB |
| 347600859 | Nov/05/2025 21:59 |
Vito Anic |
K - Hyperscale AI Data Center | Unknown | Wrong answer | 0 ms | 0 KB |
Sort by:
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/26/2026 04:59:02 (h1).
Desktop version, switch to mobile version.
Supported by
