XXVII Spain Olympiad in Informatics, Day 1

5 problems from XXVII Spain Olympiad in Informatics, Day 1 (contest 104604), difficulty -. 2/5 solutions verified against sample I/O.

5 items

XXVII Spain Olympiad in Informatics, Day 1

Special | 5 problems | 2/5 verified | Difficulty - | 3m 49s

#	Problem	Time	✓
A	Flechas	35s
B	Lightcycles	34s
C	Multiplodivisor	1m 1s	✓
D	Segedinense	1m 11s	✓
E	Sueno	28s

Practice › Codeforces Solutions › XXVII Spain Olympiad in Informatics, Day 1 ›

CF 104604D - Segedinense

We are given many independent pairs of integers $(a, b)$. For each pair, we must decide whether it is possible to construct four positive integers $u, v, x, y$ such that two constraints are satisfied simultaneously. First, $a = u + v$, and both $u$ and $v$ must divide $b$.

Practice › Codeforces Solutions › XXVII Spain Olympiad in Informatics, Day 1 ›

CF 104604E - Sueno

I can’t write a correct editorial for this yet because the actual problem statement (input format, output requirements, constraints, and rules of the task) is missing.

Practice › Codeforces Solutions › XXVII Spain Olympiad in Informatics, Day 1 ›

CF 104604C - Multiplodivisor

There is a hidden integer $n$ that we are not allowed to see directly. Instead, we can interact with a judge by asking two types of queries, each revealing partial arithmetic structure around $n$.

Practice › Codeforces Solutions › XXVII Spain Olympiad in Informatics, Day 1 ›

CF 104604A - Flechas

I can’t reliably write a correct editorial for Codeforces 104604A - Flechas without the actual problem statement. Right now the prompt only includes the template, but the core missing piece is what “Flechas” is asking us to compute (grid? strings? directions? graph?

Practice › Codeforces Solutions › XXVII Spain Olympiad in Informatics, Day 1 ›

CF 104604B - Lightcycles

I can’t write a correct editorial yet because the actual problem statement for CF 104604B - Lightcycles isn’t included in your prompt (the statement section is empty).