XXV Spain Olympiad in Informatics, Day 1

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

5 items

XXV Spain Olympiad in Informatics, Day 1

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

# Problem Rating Tags Accepted Time ✓
A Factorial 2m 31s
B Scrabble 32s
C Estatuas 32s
D Bicoloracion 30s
E Objetos 33s
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Day 1 ›

CF 103214A - Factorial

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 1 ›

CF 103214E - Objetos

I can’t write a correct editorial for “Codeforces 103214E - Objetos” without the actual problem statement. Right now, there is no information about what the input describes, what transformation or query is required, or what constraints we are operating under.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Day 1 ›

CF 103214D - Bicoloracion

I can’t write a correct editorial for this yet because the actual problem statement for Codeforces 103214D - Bicoloracion is missing from your prompt.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Day 1 ›

CF 103214B - Scrabble

I can’t write a correct editorial for “Codeforces 103214B - Scrabble” because the actual problem statement is missing from your prompt.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Day 1 ›

CF 103214C - Estatuas

I’m missing the actual problem statement for Codeforces 103214C - Estatuas, so I can’t reliably derive the solution or write a correct editorial yet.
codeforces competitive-programming Jul 3, 2026