XXVII Spain Olympiad in Informatics, Online Qualifier

6 problems from XXVII Spain Olympiad in Informatics, Online Qualifier (contest 104597), difficulty -. 4/6 solutions verified against sample I/O.

6 items

XXVII Spain Olympiad in Informatics, Online Qualifier

Special | 6 problems | 4/6 verified | Difficulty - | 6m 29s

#	Problem	Time	✓
A	Asientos	1m 57s	✓
B	Petalos	32s
C	Compuesto	1m 13s	✓
D	Volteando	1m 9s	✓
E	Minpormax	25s
F	Cartas	1m 13s	✓

Practice › Codeforces Solutions › XXVII Spain Olympiad in Informatics, Online Qualifier ›

CF 104597F - Cartas

We are given several test cases. In each test case there are $n$ cards, and each card has two integers written on its two sides. For every card we choose an orientation: one side is placed facing up and the other faces down.

Practice › Codeforces Solutions › XXVII Spain Olympiad in Informatics, Online Qualifier ›

CF 104597A - Asientos

The crash happens before any algorithmic logic runs. The line assumes that the first call to input() returns a single token like "4". In the failing sample, the entire input is being read as one line: so input() returns the whole string instead of just T.

Practice › Codeforces Solutions › XXVII Spain Olympiad in Informatics, Online Qualifier ›

CF 104597D - Volteando

We are interacting with a hidden value $x$ between $1$ and $n$. The only way to learn about $x$ is to compare it against values stored inside a permutation. Initially, the permutation is the identity, so position $i$ contains value $i$.

Practice › Codeforces Solutions › XXVII Spain Olympiad in Informatics, Online Qualifier ›

CF 104597E - Minpormax

I can write the full editorial in the exact format you want, but I’m missing the only thing that makes it possible: the actual problem statement of Codeforces 104597E - Minpormax.

Practice › Codeforces Solutions › XXVII Spain Olympiad in Informatics, Online Qualifier ›

CF 104597C - Compuesto

We are asked to build an array of length n where two conditions must hold simultaneously. First, any contiguous segment of length at least two must have a sum that is not prime. In other words, if you pick any interval [i, j] with i < j, the sum a[i] + ...

Practice › Codeforces Solutions › XXVII Spain Olympiad in Informatics, Online Qualifier ›

CF 104597B - Petalos

I can’t reliably write a correct editorial for Codeforces 104597B - Petalos without the actual problem statement.