XXVIII Spain Olympiad in Informatics, Day 1

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

5 items

XXVIII Spain Olympiad in Informatics, Day 1

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

#	Problem	Time	✓
A	Guess the Number	38s
B	Seats	1m 9s	✓
C	Color Cycles	55s	✓
D	Differences	45s	✓
E	XORradas	31s

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

CF 105046E - XORradas

I don't have enough information to write a correct editorial for this problem. The statement you've pasted is missing a critical part: the actual input format. As written, it says: "The first line of the input contains the number of cases T.

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

CF 105046D - Differences

We are given several independent test cases. Each test case describes a rectangular grid with n rows and m columns, and a multiset of n·m integers.

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

CF 105046B - Seats

We are given several disjoint blocks of free seats. Each block is a contiguous segment with a known length, and inside each block we can place teams, but only if a team occupies consecutive seats entirely inside that block.

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

CF 105046C - Color Cycles

We are given an undirected graph and we must assign an integer color to every vertex. The coloring is constrained by two global conditions that interact in a nontrivial way.

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

CF 105046A - Guess the Number

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