Shanghai University 2023 Spring Contest

10 problems from Shanghai University 2023 Spring Contest (contest 104317), difficulty -. 4/10 solutions verified against sample I/O.

10 items

Shanghai University 2023 Spring Contest

Special | 10 problems | 4/10 verified | Difficulty - | 10m 36s

#	Problem	Time	✓
A	Antiamuny wants to learn binary search	1m 1s	✓
B	Bespread with chequers	1m 10s	✓
C	Converse the string	35s
D	Deliver the string	1m 35s	✓
E	Eliminate suspicion	1m 25s
F	Fill out the multiple choice questions	29s
G	Golden jade matrix checker	28s
H	How to know the function	29s
I	I like UNO !	2m 10s
J	Juxtaposed brackets	1m 14s	✓

Practice › Codeforces Solutions › Shanghai University 2023 Spring Contest ›

CF 104317I - I like UNO !

Four players sit in a fixed order and repeatedly play cards against a shared discard pile whose current top card determines what is legal to play.

Practice › Codeforces Solutions › Shanghai University 2023 Spring Contest ›

CF 104317J - Juxtaposed brackets

We are given a recursively defined family of strings built from a single kind of primitive bracket structure. The base object is the simplest valid pair “()”.

Practice › Codeforces Solutions › Shanghai University 2023 Spring Contest ›

CF 104317H - How to know the function

The problem statement is missing from your prompt, so I don’t have enough information to write a correct editorial.

Practice › Codeforces Solutions › Shanghai University 2023 Spring Contest ›

CF 104317E - Eliminate suspicion

We are given two sets of points in a plane, each point also having a time coordinate. The first set represents people, where each person has a recorded position at a specific time. The second set represents crime events, each occurring at a position and time.

Practice › Codeforces Solutions › Shanghai University 2023 Spring Contest ›

CF 104317D - Deliver the string

We are given two strings, $A$ and $B$. We start with an empty string $C$, and we are allowed to build $C$ by repeatedly copying a substring from $A$ and appending it to the end of $C$.

Practice › Codeforces Solutions › Shanghai University 2023 Spring Contest ›

CF 104317G - Golden jade matrix checker

I can’t write a correct Codeforces editorial without the actual problem statement. Right now the prompt only includes the template, so there’s no information about what the “golden jade matrix checker” is supposed to verify, what the input looks like, or what conditions…

Practice › Codeforces Solutions › Shanghai University 2023 Spring Contest ›

CF 104317F - Fill out the multiple choice questions

The problem statement is missing from the prompt, so there’s no way to correctly reconstruct the task, constraints, or intended solution.

Practice › Codeforces Solutions › Shanghai University 2023 Spring Contest ›

CF 104317B - Bespread with chequers

We are asked to count how many ways we can completely tile a board that has exactly two rows and $n$ columns. Each tile comes from a fixed set: a domino of size $1 times 2$, which can be placed horizontally or vertically, and a square block of size $2 times 2$.

Practice › Codeforces Solutions › Shanghai University 2023 Spring Contest ›

CF 104317A - Antiamuny wants to learn binary search

We are given a procedure that behaves exactly like a standard binary search, except instead of returning the position of a target value, it returns how many loop iterations are executed until the search finds the target element.

Practice › Codeforces Solutions › Shanghai University 2023 Spring Contest ›

CF 104317C - Converse the string

I don’t have the actual statement of Codeforces 104317C (“Converse the string”) available in your prompt, so I can’t safely reconstruct the correct editorial without risking inventing rules, which would defeat the purpose of a proper solution write-up.