XXIII Spain Olympiad in Informatics, Day 2

4 problems from XXIII Spain Olympiad in Informatics, Day 2 (contest 105456), difficulty -. 3/4 solutions verified against sample I/O.

4 items

XXIII Spain Olympiad in Informatics, Day 2

Special | 4 problems | 3/4 verified | Difficulty - | 5m 24s

#	Problem	Time	✓
A	Palindrome ABC	1m 5s	✓
B	Deleting Letters from the SMS	1m 19s	✓
C	Jan's Cookies	1m 41s
D	Multidimensional Excursions	1m 19s	✓

Practice › Codeforces Solutions › XXIII Spain Olympiad in Informatics, Day 2 ›

CF 105456D - Multidimensional Excursions

We are working in a k-dimensional integer lattice. A state is a point with k integer coordinates, and each move changes exactly one coordinate by either +1 or −1. After 2n moves, we want to count how many different sequences of moves bring us back to the origin.

Practice › Codeforces Solutions › XXIII Spain Olympiad in Informatics, Day 2 ›

CF 105456A - Palindrome ABC

We are given counts of three characters, namely how many times we must use the letters A, B, and C. For each test case, the task is to construct a string using exactly those characters such that the string reads the same forwards and backwards, and among all valid such strings…

Practice › Codeforces Solutions › XXIII Spain Olympiad in Informatics, Day 2 ›

CF 105456C - Jan's Cookies

We are given several independent scenarios. In each one, there are many cookies, each cookie belongs to a type and has a deadline time when it disappears.

Practice › Codeforces Solutions › XXIII Spain Olympiad in Informatics, Day 2 ›

CF 105456B - Deleting Letters from the SMS

We are given a string of lowercase letters representing an SMS message. Pedro is required to shorten it by deleting exactly $n - k$ characters while keeping the relative order of the remaining characters unchanged.