2025 Aleppo and Idlib Private Universities Collegiate Programming Contest (APUCPC 2025)
12 problems from 2025 Aleppo and Idlib Private Universities Collegiate Programming Contest (APUCPC 2025) (contest 106068), difficulty -. 12/12 solutions verified against sample I/O.
2025 Aleppo and Idlib Private Universities Collegiate Programming Contest (APUCPC 2025)
Special | 12 problems | 12/12 verified | Difficulty - | 9m 58s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Correct Brackets | 49s | ✓ | |||
| B | SCPC is Typing... | 44s | ✓ | |||
| C | Stones Game | 48s | ✓ | |||
| D | Ba3d Khamsa | 1m 8s | ✓ | |||
| E | Sasha and palindrome | 58s | ✓ | |||
| F | Good Luck Syria | 42s | ✓ | |||
| G | Fire Coverage | 51s | ✓ | |||
| H | Wanna win? Solve | 1m 5s | ✓ | |||
| I | The judges problem | 45s | ✓ | |||
| J | Washing Machine | 51s | ✓ | |||
| K | Hassan VS Naya | 38s | ✓ | |||
| L | Triangle hole | 39s | ✓ |
CF 106068E - Sasha and palindrome
We are given a string $S$ of length at most 40. Think of its characters arranged in a line. We also have an empty string $T$. We repeatedly remove characters from either the left end or the right end of the remaining $S$, and append each removed character to the end of $T$.
CF 106068H - Wanna win? Solve
We are working with a mutable array of integers, and each query asks us to relate one index in the array to all other indices using a distance condition that depends on the value stored at those indices.
CF 106068L - Triangle hole
We start with a single equilateral triangle whose size is described by its height $H$. The process is iterative. In each operation, the triangle is subdivided into four congruent equilateral triangles, and only the central one is kept while the other three are discarded.
CF 106068G - Fire Coverage
We are working on a rectangular city grid with $N$ rows and $M$ columns. You are allowed to place $K$ fire stations on arbitrary grid cells.
CF 106068B - SCPC is Typing...
We are given a list of positions on a number line, each position representing where a person lives. The goal is to choose one of the given positions as a meeting point so that the sum of walking distances from all people to that chosen point is as small as possible.
CF 106068K - Hassan VS Naya
We start with a list of integers. Two players take turns, beginning with Naya, and each move consists of choosing any two numbers from the current list, removing them, and inserting their greatest common divisor. After exactly N − 1 moves, only one number remains.
CF 106068A - Correct Brackets
We are given a string made only of opening and closing parentheses. The only allowed operation is to take a closing parenthesis from some position and reinsert it anywhere to its left. Opening parentheses are fixed in place.
CF 106068J - Washing Machine
We are given a fixed amount of time, measured in hours, during which electricity is available. Each hour corresponds to exactly one washing cycle of a machine. There are several colors of clothes, and each color has a certain number of items that must all be washed.
CF 106068D - Ba3d Khamsa
We are given a string, and we are asked multiple independent queries on it. Each query focuses on a contiguous substring. For that substring, we are allowed to modify characters, where one operation means replacing a single character with any other lowercase English letter.
CF 106068I - The judges problem
Ten judges each pick a number between 1 and 10, representing which problem they want added to the contest. After all votes are collected, the selected problem is the one with the highest number of votes.
CF 106068F - Good Luck Syria
The task is intentionally minimal. We are given a single string, and the input is always the same fixed token. The output must reproduce that token exactly, without modification, interpretation, or transformation.
CF 106068C - Stones Game
We are given a pile of stones. Two players alternate turns, and on each turn a player removes some positive number of stones. The restriction is that the number of stones removed must be strictly smaller than the most significant bit value of the current pile size.