UTPC April Fools Contest 2024

11 problems from UTPC April Fools Contest 2024 (contest 105071), difficulty -. 7/11 solutions verified against sample I/O.

11 items

UTPC April Fools Contest 2024

April Fools | 11 problems | 7/11 verified | Difficulty - | 11m 47s

#	Problem	Time	✓
A	Are you a Robot?	41s	✓
B	Working Out	52s	✓
C	Passcode	48s	✓
D	Prestige Hunter	1m 38s
E	Something's Fishy	52s	✓
F	Those Who Know	1m	✓
G	:wink:	40s
H	Find the Bug Week 15	1m 54s
I	Oh It's XOR	1m 15s
J	Gacha Rolling	1m 16s	✓
K	Vote Here!	51s	✓

Practice › Codeforces Solutions › UTPC April Fools Contest 2024 ›

CF 105071I - Oh It's XOR

We are given an undirected graph where each vertex carries an integer value. The task is not to compute anything over all paths in the usual shortest-path sense, but instead to consider all simple paths in the graph, pick any one of them, take the XOR of the vertex values…

Practice › Codeforces Solutions › UTPC April Fools Contest 2024 ›

CF 105071K - Vote Here!

The problem gives us a single line of input that represents a user's feedback or selection of their favorite problem. The actual content of this line does not influence any computation. The task is to produce a fixed response regardless of what the input string contains.

Practice › Codeforces Solutions › UTPC April Fools Contest 2024 ›

CF 105071D - Prestige Hunter

We are given a fixed reference list of company names ordered by prestige, where position 1 corresponds to the most prestigious company. Each query consists of a company name, and we must determine whether that name appears in the reference list.

Practice › Codeforces Solutions › UTPC April Fools Contest 2024 ›

CF 105071G - :wink:

I don’t have the actual statement of Codeforces 105071G (“:wink:”) available from your prompt, so I can’t safely reconstruct the problem or write a correct editorial without risking inventing details.

Practice › Codeforces Solutions › UTPC April Fools Contest 2024 ›

CF 105071F - Those Who Know

The task gives a single string of length up to one hundred thousand characters and asks for another string as output. There is no transformation rule described in a structured way such as parsing, filtering, or reordering.

Practice › Codeforces Solutions › UTPC April Fools Contest 2024 ›

CF 105071E - Something's Fishy

The problem presents two quantities defined through limits, infinite sums, and definite integrals, and asks for a single integer derived from them. The final output is the floor of the hypotenuse of a right triangle whose legs are these two quantities.

Practice › Codeforces Solutions › UTPC April Fools Contest 2024 ›

CF 105071J - Gacha Rolling

The task is deceptively simple. You are given a single line of input describing a 10-pull action in a gacha game, but the input carries no meaningful constraints or parameters that influence the result.

Practice › Codeforces Solutions › UTPC April Fools Contest 2024 ›

CF 105071H - Find the Bug Week 15

The task is about counting how many longest strictly increasing subsequences exist in a given array. A subsequence is formed by deleting elements without changing the order of the remaining ones.

Practice › Codeforces Solutions › UTPC April Fools Contest 2024 ›

CF 105071B - Working Out

The statement provides no meaningful input format and no explicit output requirement beyond the problem title. Interpreting this in the way Codeforces sometimes frames puzzle or joke problems, the only consistent reading is that the program is not expected to process any data…

Practice › Codeforces Solutions › UTPC April Fools Contest 2024 ›

CF 105071C - Passcode

The task does not involve computation over an input in the usual sense. There is no dataset to transform and no structure to analyze. Instead, the judge is waiting for a single fixed string: Alice’s forgotten five-digit passcode. The interaction rules are simple but strict.

Practice › Codeforces Solutions › UTPC April Fools Contest 2024 ›

CF 105071A - Are you a Robot?

You are given several independent test cases. Each test case describes a short string consisting of characters that represent a state or response sequence produced by a system that might or might not be a robot.