Hello, Codeforces!
UTPC, the competitive programming organization at the University of Texas at Austin, is happy to invite you to participate in our annual UT Open contest, which will be held on Sunday, April 06, 2025 at 12:30PM UTC-6 (CST).
You will be given 13 problems (not ordered by difficulty) and 5 hours to solve them, with standard ICPC scoring. There will be a wide range of difficulties -- anyone is welcome to participate! This is a team contest for teams with up to 3 members. This is (of course) not an official Codeforces round, and is thus unrated.
The problems were prepared and tested by bubbarob19, ChiMasterBing, DylanSmith, fishy15, GhOsT16790, m7a1g5i8k8a1r4p0, meize, mwen, RandyG, tn757, WalrusRamen21, and zmonster8.
Additionally, we'd like to give special thanks to evouga2, Kuroni, and tfg for testing the contest and providing valuable feedback!
And also a huge thanks to speedycatfish for planning logistics! We would like to thank:
evouga2, gpdowning, and Kuroni for being great resources and coaches for the UT Austin ICPC teams,
Jane Street, our generous sponsor,
MikeMirzayanov for the great platforms Codeforces and Polygon,
and all of you, for participating!
Below is the link to the contest: https://codeforces.me/gym/105811
Good luck and have fun!









Auto comment: topic has been updated by UTPC_Admin (previous revision, new revision, compare).
Auto comment: topic has been updated by UTPC_Admin (previous revision, new revision, compare).
you might want to change the date from "February 26, 2025" to "April 6th, 2025" in the 2nd line of blog.
Auto comment: topic has been updated by UTPC_Admin (previous revision, new revision, compare).
As a problem writer, there is at least one problem where you will have to output a number
Thank you for the valuable insight. I will now solve every problem that asks to print a number to prepare for the contest.
any progress?
Auto comment: topic has been updated by UTPC_Admin (previous revision, new revision, compare).
Is the editorial for this contest out? If not, could someone explain how to solve problem H?
Read about edge covering and bipartite matching