XXIV Spain Olympiad in Informatics, Online Qualifier 2

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

6 items

XXIV Spain Olympiad in Informatics, Online Qualifier 2

Special | 6 problems | 5/6 verified | Difficulty - | 8m 27s

#	Problem	Time	✓
A	No More Ties!	1m 10s	✓
B	Dividing	1m 20s
C	Games with Queta	1m 14s	✓
D	Coins 3	2m 13s	✓
E	Separated Cells	1m 17s	✓
F	Painting Squares	1m 13s	✓

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Online Qualifier 2 ›

CF 105404D - Coins 3

We are given a multiset of coin values and a target amount $k$. Pedro processes the coins in a very specific way: he sorts them in descending order and scans from largest to smallest. While scanning, he maintains a remaining amount he still needs to pay.

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Online Qualifier 2 ›

CF 105404E - Separated Cells

We are given a tree, meaning a set of nodes connected with exactly one simple path between any two nodes. Each node represents a prison cell that can hold at most one inmate.

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Online Qualifier 2 ›

CF 105404A - No More Ties!

We are given several independent scenarios. In each scenario, a contest has a list of participant scores and only the top k participants are supposed to qualify.

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Online Qualifier 2 ›

CF 105404F - Painting Squares

We start with an empty grid of size $n times m$, where every cell is initially white. The only way to modify the grid is to choose whole rows or whole columns and paint them completely black.

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Online Qualifier 2 ›

CF 105404B - Dividing

We are given several independent test cases. Each test case provides a list of positive integers. The task is to determine whether there exists at least one element in the list that can divide every element in the same list, including itself in a trivial way.

Practice › Codeforces Solutions › XXIV Spain Olympiad in Informatics, Online Qualifier 2 ›

CF 105404C - Games with Queta

We are given a segment on a line, marked by two fixed points. Inside this segment there are several objects, each placed at a distinct coordinate. Every object is initially facing either left toward the first mark or right toward the second mark.