XXII Spain Olympiad in Informatics, Online Qualifier 2

4 problems from XXII Spain Olympiad in Informatics, Online Qualifier 2 (contest 105478), difficulty -. 2/4 solutions verified against sample I/O.

4 items

XXII Spain Olympiad in Informatics, Online Qualifier 2

Special | 4 problems | 2/4 verified | Difficulty - | 6m 4s

#	Problem	Time	✓
A	Barcelona Distance	1m 37s
B	The Very Difficult Exam	1m 34s
C	Greed	2m 8s	✓
D	abbaaaba	45s	✓

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

CF 105478D - abbaaaba

We are given a string made only of the characters a and b. The task is to analyze this string and determine a property related to how it can be reduced or matched against a fixed pattern that contains a small, structured arrangement of a and b characters.

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

CF 105478A - Barcelona Distance

The city is modeled as an infinite grid where movement is constrained to streets aligned with the axes, but with an additional structure: there is a special diagonal street passing through the origin and extending along the line from $(0,0)$ to $(10,10)$ repeatedly across the…

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

CF 105478B - The Very Difficult Exam

We are given a multiple-choice exam answer sheet represented as a string. Each position corresponds to a question, and each character is either a fixed choice among A, B, C or an unknown marked with a question mark.

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

CF 105478C - Greed

Each test case gives a shop structured as several independent stacks of items. In each stack, items are arranged in a fixed order from top to bottom, and you are only allowed to access the next item in a stack if you have already bought everything above it.