2024 Aleppo Collegiate Programming Contest

13 problems from 2024 Aleppo Collegiate Programming Contest (contest 105316), difficulty -. 13/13 solutions verified against sample I/O.

13 items

2024 Aleppo Collegiate Programming Contest

Special | 13 problems | 13/13 verified | Difficulty - | 11m 44s

#	Problem	Time	✓
A	Rajaee in the Kitchen	1m 2s	✓
B	Omar's Magic Trick	1m 10s	✓
C	Hungry Horse	53s	✓
D	Switching To Windows	57s	✓
E	Zero Hour	47s	✓
F	Legend Whispers	57s	✓
G	Intersection Not Allowed	50s	✓
H	One Punch MEX	1m 7s	✓
I	Nested Circles	46s	✓
J	Epic Fight	49s	✓
K	Marks	47s	✓
L	BBS Queries	56s	✓
M	ACPC	43s	✓

Practice › Codeforces Solutions › 2024 Aleppo Collegiate Programming Contest ›

CF 105316D - Switching To Windows

We maintain a collection of labeled strings. Each string is introduced by a query, and from that moment it behaves like an object with an identifier equal to the time it was inserted. Alongside each string we store a numeric value.

Practice › Codeforces Solutions › 2024 Aleppo Collegiate Programming Contest ›

CF 105316L - BBS Queries

We are given a balanced parentheses sequence of length $2n$. Every position in this sequence is a bracket, and every opening bracket is matched with exactly one closing bracket, forming a tree-like nesting structure.

Practice › Codeforces Solutions › 2024 Aleppo Collegiate Programming Contest ›

CF 105316M - ACPC

We are given a single short string representing a friend’s name. Regardless of what this string is, we must always output the same fixed word.

Practice › Codeforces Solutions › 2024 Aleppo Collegiate Programming Contest ›

CF 105316J - Epic Fight

We are given a line of $n$ cells connected like a simple path, so from any cell $i$ you can move only to $i-1$ or $i+1$ if those exist. A token starts on a chosen cell, and that cell is immediately marked as visited. Two players alternate moves, starting with Ahmad.

Practice › Codeforces Solutions › 2024 Aleppo Collegiate Programming Contest ›

CF 105316H - One Punch MEX

We start with a collection of stones labeled from 1 to n. All stones are present initially. Then a random process runs for exactly n steps. At each step, one of the remaining stones is chosen uniformly at random and removed permanently.

Practice › Codeforces Solutions › 2024 Aleppo Collegiate Programming Contest ›

CF 105316I - Nested Circles

We are given several circles on a 2D integer grid, each defined by a center point and a radius. After reading all circles, we receive a sequence of query points. For each query point, we must count how many of the given circles contain or touch that point.

Practice › Codeforces Solutions › 2024 Aleppo Collegiate Programming Contest ›

CF 105316F - Legend Whispers

We are given two arrays of the same length. The second array is fixed, but the first array can be permuted arbitrarily. After choosing a permutation of the first array, each position pairs one value from the first array with one value from the second array.

Practice › Codeforces Solutions › 2024 Aleppo Collegiate Programming Contest ›

CF 105316E - Zero Hour

We are given several independent test cases. In each test case, we receive a list of integer values, where each value represents the power of a soldier.

Practice › Codeforces Solutions › 2024 Aleppo Collegiate Programming Contest ›

CF 105316A - Rajaee in the Kitchen

We are given an array of positive integers. The task is to split it into several consecutive non-empty segments. Each element must belong to exactly one segment, so every valid solution corresponds to a full partition of the array into contiguous blocks.

Practice › Codeforces Solutions › 2024 Aleppo Collegiate Programming Contest ›

CF 105316C - Hungry Horse

We are given several independent scenarios where a horse starts at position 0 and moves only in the positive direction along a line. Along this line there are food dishes placed at distinct positions. Each dish requires some fixed amount of time to eat once the horse reaches it.

Practice › Codeforces Solutions › 2024 Aleppo Collegiate Programming Contest ›

CF 105316K - Marks

Each test case describes a classroom snapshot. For every test case, we are given several students, and for each student we receive exactly eight integers representing their scores in eight different subjects.

Practice › Codeforces Solutions › 2024 Aleppo Collegiate Programming Contest ›

CF 105316G - Intersection Not Allowed

We are given multiple independent test cases. In each test case there are $n$ lockers and $q$ rental requests. Each request fixes one locker $x$ and a time interval $[l, r]$, meaning that locker $x$ is occupied throughout that entire interval.

Practice › Codeforces Solutions › 2024 Aleppo Collegiate Programming Contest ›

CF 105316B - Omar's Magic Trick

We are given a deterministic process that starts with exactly three single-digit cards. Each card holds a value from 1 to 9. The process repeatedly transforms the whole collection: every card value is multiplied by 3, and then the result is split back into its decimal digits.