XXV Spain Olympiad in Informatics, Day 2

5 problems from XXV Spain Olympiad in Informatics, Day 2 (contest 103218), difficulty -. 0/5 solutions verified against sample I/O.

5 items

XXV Spain Olympiad in Informatics, Day 2

Special | 5 problems | 0/5 verified | Difficulty - | 4m 22s

# Problem Rating Tags Accepted Time ✓
A Atrapasuenos 2m 27s
B Xor 34s
C Organigramas 30s
D Caballeros 28s
E Rompepuertas 23s
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Day 2 ›

CF 103218A - Atrapasuenos

Let $A$ be a family of $t$-combinations, and let $partial A$ denote its shadow, the family of all $(t-1)$-combinations contained in members of $A$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Day 2 ›

CF 103218E - Rompepuertas

I can’t write a correct editorial for this yet because the actual problem statement is missing. “Codeforces 103218E - Rompepuertas” isn’t enough on its own to reconstruct the task reliably, and guessing would almost certainly produce the wrong solution and structure.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Day 2 ›

CF 103218D - Caballeros

The problem statement for “Codeforces 103218D - Caballeros” is missing from your prompt, so there is no defined task, input format, or required output to base an editorial on.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Day 2 ›

CF 103218B - Xor

The problem statement is missing from your prompt, so I can’t reliably reconstruct what “Codeforces 103218B - Xor” is asking.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Day 2 ›

CF 103218C - Organigramas

I can’t produce a correct editorial for this yet because the actual problem statement (what “Organigramas” is asking us to compute) is missing.
codeforces competitive-programming Jul 3, 2026