Shorouk Academy 2024 Collegiate Programming Contest

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

13 items

Shorouk Academy 2024 Collegiate Programming Contest

Special | 13 problems | 13/13 verified | Difficulty - | 13m 15s

#	Problem	Time	✓
A	Khepri and the Counting Problem	2m 47s	✓
B	Swaps	56s	✓
C	LCIS	46s	✓
D	Two Triangles	38s	✓
E	The Longest Half Hour in the World	1m 2s	✓
F	Semi Palindrome	54s	✓
G	Bonus System	45s	✓
H	Array Subsequence	56s	✓
I	Drink Distribution	44s	✓
J	Problem Name	53s	✓
K	The Identity Crisis of Abdelaleem: A Prime Substring	46s	✓
L	15 Prime	1m 25s	✓
M	Problem Validator	43s	✓

Practice › Codeforces Solutions › Shorouk Academy 2024 Collegiate Programming Contest ›

CF 105129L - 15 Prime

For each test case, we are given an array of integers. We must construct the smallest positive integer m such that every array element shares a common divisor greater than 1 with m. In other words, for every value ai, the greatest common divisor gcd(ai, m) must be at least 2.

Practice › Codeforces Solutions › Shorouk Academy 2024 Collegiate Programming Contest ›

CF 105129M - Problem Validator

The system we are validating is extremely simple: for each test case, we are told how many tests a program was supposed to run and how many of them it actually passed. From this, we decide whether the program fully succeeded or not.

Practice › Codeforces Solutions › Shorouk Academy 2024 Collegiate Programming Contest ›

CF 105129K - The Identity Crisis of Abdelaleem: A Prime Substring

We are given a binary string, and we are allowed to take any contiguous segment of it. Each such segment is interpreted as a binary number, and we want to know whether at least one of these numbers is a prime.

Practice › Codeforces Solutions › Shorouk Academy 2024 Collegiate Programming Contest ›

CF 105129J - Problem Name

We are given an integer starting point and a forbidden digit. From the starting number, we are allowed to repeatedly increase it by one. The goal is to reach the first number at or after the starting point whose decimal representation does not contain the forbidden digit at all.

Practice › Codeforces Solutions › Shorouk Academy 2024 Collegiate Programming Contest ›

CF 105129A - Khepri and the Counting Problem

For each test case, we are given a positive integer n. We must count how many positive integers in the range from 1 to n have an odd number of decimal digits. The value of n can be as large as 10^18. That immediately rules out any solution that examines every number individually.

Practice › Codeforces Solutions › Shorouk Academy 2024 Collegiate Programming Contest ›

CF 105129I - Drink Distribution

Each test case gives a collection of juice bottles, where the i-th bottle contains a certain number of liters. Abdelaleem will serve exactly m friends, and for each chosen bottle he is allowed to pour the same integer amount of liters into every friend’s cup.

Practice › Codeforces Solutions › Shorouk Academy 2024 Collegiate Programming Contest ›

CF 105129H - Array Subsequence

We are given an array and asked to think about all ways to choose exactly k elements while preserving order, although the order constraint does not affect which values end up selected, only which subsets are valid.

Practice › Codeforces Solutions › Shorouk Academy 2024 Collegiate Programming Contest ›

CF 105129G - Bonus System

We are simulating a small training management system that keeps track of students and their accumulated bonus points. Each student has a fixed identity given by an index from 1 to n and an associated name. Initially, all students start with zero points.

Practice › Codeforces Solutions › Shorouk Academy 2024 Collegiate Programming Contest ›

CF 105129E - The Longest Half Hour in the World

We are given three integers $l$, $r$, and $k$. The task is to count how many integers $x$ in the range $[l, r]$ satisfy a condition derived from a digit-selection construction: the number $x$ must be representable as a concatenation of chosen “digits”, where each chosen…

Practice › Codeforces Solutions › Shorouk Academy 2024 Collegiate Programming Contest ›

CF 105129F - Semi Palindrome

We maintain a mutable string over lowercase letters. Two operations are supported: point updates that overwrite a single position, and queries over a substring asking whether that segment can be turned into a palindrome after changing at most one character inside the segment.

Practice › Codeforces Solutions › Shorouk Academy 2024 Collegiate Programming Contest ›

CF 105129D - Two Triangles

Each test case describes a right-angled triangle using its base and height. The task is not to compute the actual geometric area, but instead to output twice that area. A right triangle’s area is computed as half of the product of its base and height.

Practice › Codeforces Solutions › Shorouk Academy 2024 Collegiate Programming Contest ›

CF 105129B - Swaps

We are given two equal-length strings over the lowercase alphabet. The allowed move is not a local edit but a global relabeling: we pick two distinct letters, and every occurrence of those two letters in the string is swapped simultaneously.

Practice › Codeforces Solutions › Shorouk Academy 2024 Collegiate Programming Contest ›

CF 105129C - LCIS

We are given two sequences, each a permutation of the same set of integers from 1 to n. The task is to find the length of the longest subsequence that appears in both permutations and is strictly increasing.