XXVIII Spain Olympiad in Informatics, Day 2

5 problems from XXVIII Spain Olympiad in Informatics, Day 2 (contest 105047), difficulty -. 3/5 solutions verified against sample I/O.

5 items

XXVIII Spain Olympiad in Informatics, Day 2

Special | 5 problems | 3/5 verified | Difficulty - | 3m 36s

#	Problem	Time	✓
A	Card Game	29s
B	Equalizing	48s	✓
C	Rectangle	51s	✓
D	Resto	28s
E	XOR Sorting	1m	✓

Practice › Codeforces Solutions › XXVIII Spain Olympiad in Informatics, Day 2 ›

CF 105047E - XOR Sorting

We are given an array of integers, and we are allowed to repeatedly apply a single destructive operation: pick two different positions, and replace the first position by the XOR of its current value with the second position’s value. The second position is never modified.

Practice › Codeforces Solutions › XXVIII Spain Olympiad in Informatics, Day 2 ›

CF 105047D - Resto

I'm missing the actual Codeforces problem details needed to write a correct editorial. The statement you pasted is corrupted in several places: - The sample input is malformed. It begins with 3 2 even though the format says the first number is T.

Practice › Codeforces Solutions › XXVIII Spain Olympiad in Informatics, Day 2 ›

CF 105047C - Rectangle

We are interacting with a hidden axis-aligned rectangle whose side lengths are two unknown integers $a$ and $b$, both at most 100. We cannot see these values directly.

Practice › Codeforces Solutions › XXVIII Spain Olympiad in Informatics, Day 2 ›

CF 105047B - Equalizing

We are given an array of integers. The goal is to raise every element so that it reaches at least a threshold value k. The only way to modify the array is through a very specific operation applied to a chosen index i.

Practice › Codeforces Solutions › XXVIII Spain Olympiad in Informatics, Day 2 ›

CF 105047A - Card Game

This request cannot be fulfilled as written because the problem is interactive, not a standard input/output problem.