UTPC April Fool's Contest 2026 Editorial The [prophecy](https://codeforces.me/blog/entry/127899) is true: "Hopefully we will have many more years :)" [A &mdash; Captcha](https://codeforces.me/gym/106452/problem/A) Author: [user:m7a1g5i8k8a1r4p0,2026-04-02] <spoiler summary="Solution"> Just print the number of circles in the image. There are `7` if you include the circles in `i` and `?`. </spoiler> <spoiler summary="Feedback"> - Best Problem Ever - Incredible Problem - Amazing Problem - Great Problem - Good Problem </spoiler> [B &mdash; Right or Wrong?](https://codeforces.me/gym/106452/problem/B) Author: [user:m7a1g5i8k8a1r4p0,2026-04-02] <spoiler summary="Solution"> The title implies that you should check if the 3 numbers are "right" or not. You can do this by checking that $a$, $b$, and $c$ form the side lengths of a right triangle, with $c$ as the hypotenuse. </spoiler> <spoiler summary="Feedback"> - Best Prob...

Полный текст и комментарии »

UTPC April Fools' Contest 2024 Editorial Hello everyone! Hope you enjoyed our contest, this was our first time making a contest in this fashion. Hopefully we will have many more years :) [A – Are you a Robot?](https://codeforces.me/gym/105071/problem/A) Author: [user:blueberryJam,2024-04-02] <spoiler summary="Solution"> The answer is `No`. We would also accept the full CAPTCHA, $$JR5JNYNJSABN03BIELLEQ9PA9REEUXO5DXSA4C5S$$ $$U6A9SXD2A2VR00B5SUWPX38ONBR9THZ8Y80Q18Z$$ $$JI4ESKAWMU7MX5K33EAFXPR7323LP4DMTI3YSZL2$$ $$4EIUYBZJBHD7OVF6GEIE28JUQVILEIWWDM8RHKZ8$$ for those who have the patience to type it out. </spoiler> <spoiler summary="Feedback"> - Good problem - Amazing problem - Best problem ever </spoiler> [B – Working Out](https://codeforces.me/gym/105071/problem/B) Author: [user:sg2themax,2024-04-02] <spoiler summary="Solution"> Simple dad joke: anything containing "codeforces gym" works as a valid output (including the URL, or just the ph...

Полный текст и комментарии »

UTPC Spring 2024 Open Contest Editorial Hope you enjoyed our contest! The editorial is below: [A &mdash; Skipping Songs](https://codeforces.me/gym/105109/problem/A) Author: [user:sg2themax,2024-04-21] <spoiler summary="Solution"> For this problem, you maintain an index counter pointing to the current song, starting at 0. At each step, you always ensure that you mod by the length of the record. You start off by playing the song at the index of the first number. After printing each song, you increment by one since Noah has "finished listening" to it. Then, you add the number of skips, print the next song, and repeat. </spoiler> [B &mdash; 6th heaven](https://codeforces.me/gym/105109/problem/B) Author: [user:blueberryJam,2024-04-21] <spoiler summary="Solution"> We first check whether the conditions can be satisfied, then if so compute the number of arrangements. #### Pruning Consider a situation in which a disk appears three times or more among all the distinct pairs. This is impossible to arrange...

Полный текст и комментарии »

UTPC Fall 2024 Contest #1 Editorial Hope you enjoyed our contest! The editorial is below: [A &mdash; Spookeepy](https://codeforces.me/gym/105346/problem/A) Author: [user:porkchops,2024-09-19] <spoiler summary="Solution"> We can use distance formula to calculate the distance from each point in the map to your current location. We return the point with minimum distance. If there are multiple points at the same minimum distance, keep the point with the smallest x-coordinate, and if there is still a tie, keep the point with the smallest y-coordinate (as stated in the problem description). </spoiler> [B &mdash; Ternary Nightmare](https://codeforces.me/gym/105346/problem/B) Author: [user:B-1168,2024-09-19] <spoiler summary="Solution"> The specific mixtures of 0, 1, and 2s are not as significant as the length of contiguous blocks of 0s and 1s (those "contiguous blocks" can have length 0, when between consecutive instances of 2). For example, we can parse the $1201012200120012$ sample into 0-1 blocks of le...

Полный текст и комментарии »

UTPC Contest 10-01-21 Editorial? Is there an editorial published somewhere? I have checked [UTPC's official website](https://www.cs.utexas.edu/users/utpc/index.html) but couldn't find anything. Would love to see some explanations for the harder problems. Participants' solutions can't be viewed, is this intentional too?

Полный текст и комментарии »