By adamant, history, 3 weeks ago,

Hello everyone! The 7th Stage of the 1st Universal Cup: Zaporizhzhia, will be held on March 11th, 2023.

The contest is based on the Day 2: Oleksandr Kulkov Contest 3 from the Osijek Competitive Programming Camp 2023. Please, don't participate if you have seen these problems.

Authors of the problems: adamant, fedimser, I would also like to thank -is-this-fft- for the help with the preparation of the contest.

We hope you will like the problems!

You can participate in the contest in the following three time windows:

• Mar 11th 13:00 — 18:00 (UTC +8)
• Mar 11th 19:00 — 24:00 (UTC +8)
• Mar 12th 02:00 — 07:00 (UTC +8)

Please note that you can see two scoreboards in DOMjudge. The 'Local Scoreboard' shows the standings ONLY IN THE CURRENT TIME WINDOW. And the 'Combined Scoreboard' shows all participants, including the onsite participants, and the cup participants in the previous time windows.

Universal Cup Scoreboard: https://qoj.ac/ucup/scoreboard

Universal Cup is a non-profit organization dedicated to providing trainings for competitive programming teams. Up to now, there are more than 200 teams from all over the world registering for Universal Cup.

A more detailed introduction: https://codeforces.com/blog/entry/111672

Register a new team: https://ucup.ac/register

• +247

 » 3 weeks ago, # | ← Rev. 2 →   +13 Best of luck !!
 » 3 weeks ago, # |   +5 is it rated?
 » 3 weeks ago, # |   0 What are colored scores in the rating page? ucup.ac rating
•  » » 3 weeks ago, # ^ |   0 It looks to be scores created through External Rating.
•  » » » 3 weeks ago, # ^ |   +21 Yes you are correct. The ratings marked red are the external ones. And the ratings marked blue are the ratings assigned to the author(s).
 » 3 weeks ago, # |   -23 muchas gracias aficiónados esto para vosotros SIUUUUUUUUUUUUUUUUUUUUUUUUUUUUU
 » 3 weeks ago, # |   -10 to participate in contest i need team, am I right?
 » 3 weeks ago, # |   0 I sent an email for registration yesterday evening, but I haven't received an answer yet. When will the answer come?
•  » » 3 weeks ago, # ^ |   +20 Don't be worried. They will be processed before the contest. All applications (including the rejected ones) will be answered and get a reply.
•  » » » 3 weeks ago, # ^ |   0 okay thanks
 » 2 weeks ago, # |   0 Can somebody help me with the tutorial of "Problem H. Graph Isomorphism"? tutorial"... it has at least (n − 1)! automorphisms. This is a very specific limitation and for n > 4 it essentially means that either any permutation is an automorphism, or all permutations with a certain fixed points are automorphisms." How to prove this?Additionally, is there a better thread/post to discuss university cup questions under?
•  » » 2 weeks ago, # ^ |   +5 Jeroen wrote a detailed elementary proof here. Otherwise, one can prove through obscure group theoretic stuff that $S_n$ only has $A_n$ and $S_{n-1}$ as subgroups of index $\leq n$ for $n > 4$.
•  » » » 2 weeks ago, # ^ |   0 Thanks!