XXVI Spain Olympiad in Informatics, Day 1

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

5 items

XXVI Spain Olympiad in Informatics, Day 1

Special | 5 problems | 5/5 verified | Difficulty - | 5m 1s

#	Problem	Time	✓
A	Pintando	1m 7s	✓
B	MCD	1m 14s	✓
C	Teatro	46s	✓
D	Sumas	48s	✓
E	Inspectores	1m 6s	✓

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

CF 103806E - Inspectores

We are given a line of houses indexed from 1 to n. Each house starts with an initial bank balance. Then a sequence of events happens over time. Some events modify balances over a whole interval of houses by adding a value that can be positive or negative.

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

CF 103806D - Sumas

We are given an array of integers and a fixed modulus value $m$. One player, Berta, gets to choose two elements that end up in the same group, and she wins if the sum of those two elements is divisible by $m$.

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

CF 103806B - MCD

We are interacting with a judge that has fixed but hidden integers $x$ and $y$, each up to $10^{18}$. Our only way to learn about them is by asking queries of the form $(a,b)$, and receiving back the value of $gcd( The goal is to determine both coordinates exactly, using at…

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

CF 103806A - Pintando

We are given a process that evolves on an undirected connected graph with $n$ vertices. The process depends on a sequence of integers $a1, a2, dots, am$, which we can think of as “distance jumps over time”. A starting vertex is chosen and marked as painted at day 0.

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

CF 103806C - Teatro

We are given several independent scenarios, each describing a group of friends attending a theater. Each friend has already been assigned a seat, specified by a pair of integers representing a row and a column. The seating layout is unusual in how columns are numbered.