XXV Spain Olympiad in Informatics, Online Qualifier 2

6 problems from XXV Spain Olympiad in Informatics, Online Qualifier 2 (contest 105364), difficulty -. 2/6 solutions verified against sample I/O.

6 items

XXV Spain Olympiad in Informatics, Online Qualifier 2

Special | 6 problems | 2/6 verified | Difficulty - | 12m 30s

# Problem Rating Tags Accepted Time ✓
A Pairs 1m 15s ✓
B Papalindromes! 5m 5s
C Numbers in the Grid 1m 8s ✓
D Colored Towers 1m 27s
E Painting Crosswalks 1m 48s
F Gold Cubes 1m 47s
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Online Qualifier 2 ›

CF 105364B - Papalindromes!

We are given a starting integer and a deterministic process that repeatedly transforms it. At each step, we take the current number, reverse its decimal representation, average the two values, and round the result down to an integer.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Online Qualifier 2 ›

CF 105364F - Gold Cubes

Each test case describes a very small “production system” that assembles gold cubes from three types of nuggets. Every nugget type has a fixed weight in milligrams, and we are also given a maximum available count for each type.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Online Qualifier 2 ›

CF 105364E - Painting Crosswalks

We are given several independent road segments, each containing a set of existing painted crosswalk stripes. Every stripe is described by its starting position and its width, so each one occupies a continuous interval on a number line. These stripes may overlap or leave gaps.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Online Qualifier 2 ›

CF 105364D - Colored Towers

We are given several test cases. In each case, María owns disks of different colors, and for each color we know how many identical disks she has. She wants to partition all disks into several vertical towers.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Online Qualifier 2 ›

CF 105364A - Pairs

We are given several independent test cases. In each one, we receive an even-length list of integers, and we must decide whether it is possible to partition the numbers into pairs such that every pair has the same sum.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › XXV Spain Olympiad in Informatics, Online Qualifier 2 ›

CF 105364C - Numbers in the Grid

We are working with a rectangular grid that starts completely empty in the sense that every cell initially holds zero. Then we perform a sequence of operations.
codeforces competitive-programming Jun 23, 2026