Al-Baath Collegiate Programming Contest 2023

13 problems from Al-Baath Collegiate Programming Contest 2023 (contest 104447), difficulty -. 13/13 solutions verified against sample I/O.

13 items

Al-Baath Collegiate Programming Contest 2023

Special | 13 problems | 13/13 verified | Difficulty - | 12m 22s

# Problem Rating Tags Accepted Time ✓
A Is It A Math Problem? 48s ✓
B How Aswad Use Telegram? 1m 1s ✓
C What Happens To Bashar's Laptop? 1m 16s ✓
D Could you help the judges? 55s ✓
E What Does Geo Do In His Free Time 1m 3s ✓
F Isn't it a hard problem? 1m 2s ✓
G What is Kaito's delimma? 1m 3s ✓
H Do you love HIAST? 47s ✓
I Will you accept Basharo challenge? 1m 9s ✓
J How Kifah sees Extreme? 51s ✓
K Do you believe that this is a real story? 1m 6s ✓
L Amazing Teacher 36s ✓
M Is it possible? 45s ✓
Practice › Codeforces Solutions › Al-Baath Collegiate Programming Contest 2023 ›

CF 104447M - Is it possible?

We start with a coin at coordinate (0, 0) on an infinite integer grid. Time progresses in discrete steps starting from 1. At each step i, we choose any integer xi, and then the coin moves in a constrained way depending on whether the step is odd or even.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Al-Baath Collegiate Programming Contest 2023 ›

CF 104447L - Amazing Teacher

We are given a sequence of independent test cases. Each test case contains a single integer representing a student's original score on a 0 to 10 scale.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Al-Baath Collegiate Programming Contest 2023 ›

CF 104447K - Do you believe that this is a real story?

We are given a circle of n cards labeled from 1 to n. Initially every card is black. We are allowed to perform a sequence of operations, and each operation permanently paints one black card red.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Al-Baath Collegiate Programming Contest 2023 ›

CF 104447J - How Kifah sees Extreme?

We are given an array of integers, and we are allowed to repeatedly modify individual elements using bit-level operations. In one operation, we pick a single element and either turn off one set bit in its binary representation or turn on two bits that are currently zero.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Al-Baath Collegiate Programming Contest 2023 ›

CF 104447I - Will you accept Basharo challenge?

We are given a tree with n vertices. Each vertex has a label called its color, and every edge connects two vertices in a unique way since the graph is a tree. For any two vertices u and v, there is a unique simple path between them.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Al-Baath Collegiate Programming Contest 2023 ›

CF 104447H - Do you love HIAST?

We are given a polygon drawn on a grid, but unlike arbitrary polygons it has a strong structure: every edge is either perfectly horizontal or perfectly vertical, and the vertices are listed in clockwise order.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Al-Baath Collegiate Programming Contest 2023 ›

CF 104447G - What is Kaito's delimma?

We are given multiple independent test cases. In each test case, there is a list of integers representing Kaito’s friends, and a target value x.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Al-Baath Collegiate Programming Contest 2023 ›

CF 104447F - Isn't it a hard problem?

We are given multiple test cases. In each test case there is an array of strings, each string carrying a value. Alongside, we are allowed a limited budget of character edits, where one edit changes a single character in any string to any other character.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Al-Baath Collegiate Programming Contest 2023 ›

CF 104447E - What Does Geo Do In His Free Time

We are simulating a process on a set of $n$ identical dice, each die independently showing a uniformly random face from $1$ to $k$ every time it is rolled. The game proceeds in rounds.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Al-Baath Collegiate Programming Contest 2023 ›

CF 104447D - Could you help the judges?

We are given an array of integers where each value is at most 1023, so every number fits in 10 bits. The judges are interested in the strongest possible contiguous segment in terms of XOR, where “strongest” means the maximum possible XOR over any subarray.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Al-Baath Collegiate Programming Contest 2023 ›

CF 104447C - What Happens To Bashar's Laptop?

We are given a rooted folder system that starts as a fixed tree with nodes labeled from 1 to n, where folder 1 is the root. Each folder contains a list of child folders, so the input defines a directed tree structure over these initial nodes.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Al-Baath Collegiate Programming Contest 2023 ›

CF 104447B - How Aswad Use Telegram?

We are given a chronological log of messages in a group chat. Each message has a sender and a timestamp. One particular participant, Aswad, follows a fixed reaction rule: whenever a message appears, he starts a waiting timer of length k minutes.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Al-Baath Collegiate Programming Contest 2023 ›

CF 104447A - Is It A Math Problem?

We are given a single integer $n$. From this number, we first consider all its positive divisors. If $n = 10$, the divisors are $1, 2, 5, 10$. The problem defines a special value built from these divisors: take their product.
codeforces competitive-programming Jun 30, 2026