2023 ICPC HIAST Collegiate Programming Contest

14 problems from 2023 ICPC HIAST Collegiate Programming Contest (contest 104493), difficulty -. 14/14 solutions verified against sample I/O.

14 items

2023 ICPC HIAST Collegiate Programming Contest

ICPC/IOI | 14 problems | 14/14 verified | Difficulty - | 15m 22s

#	Problem	Time	✓
A	Gym Plates	2m 1s	✓
B	Convarge To 1	1m 7s	✓
C	Tree Permutation	53s	✓
D	To Be Named	1m	✓
E	Sad Teacher	1m 4s	✓
F	New Board Game	50s	✓
G	Don't Make It 2	42s	✓
H	Yaser In Baradah	1m	✓
I	Ajam's Password	1m 57s	✓
J	Completely Balanced	49s	✓
K	Sam-Oh, the funny coach	51s	✓
L	Trip Discount	1m 6s	✓
M	Ahmad's Dish	1m 9s	✓
N	Ziftawi's Tree	53s	✓

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493N - Ziftawi's Tree

We are maintaining a rooted tree that starts with a single node numbered 1. This root has an initial value x. Over time, we only grow the tree by attaching new nodes as children of existing nodes, and every new node carries a value given at creation time.

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493M - Ahmad's Dish

We are given a circular table with radius $R$. We also have an unlimited supply of identical regular $N$-sided polygons, each with side length $L$.

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493I - Ajam's Password

This failure is no longer about parsing or indexing. The code is now consistently producing a valid permutation-like construction, but it is solving the wrong problem.

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493L - Trip Discount

We are given a weighted tree where each edge represents a road with a travel cost. On top of that, we receive a list of planned trips, where each trip goes along the unique simple path between two nodes and accumulates the sum of edge weights on that path.

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493K - Sam-Oh, the funny coach

Each contestant ends up with a single string of length m. This string is already sorted in non-decreasing order, so it consists of runs of identical characters: some number of 'a', then some number of 'b', and so on up to 'z'. The task is to answer many queries.

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493J - Completely Balanced

We are given an integer array for each test case, and we are allowed to insert exactly one additional integer value $X$ anywhere in the array. After this insertion, the array size increases by one, and both the arithmetic mean and the median are recomputed on the new array.

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493H - Yaser In Baradah

We are given a linear river split into n sections. Each section initially holds some number of fish. Each section also has a net that starts closed. An operation consists of choosing a section i that has not been chosen before and opening its net.

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493F - New Board Game

We are given an $n times n$ grid filled with integers from $1$ to $n$. Each value appears exactly $n$ times in total, so the grid is perfectly balanced in terms of frequency, but otherwise arbitrary. We are allowed to apply two global operations any number of times.

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493G - Don't Make It 2

We are given a large integer $N$ and we need to construct another integer $X$ that is strictly smaller than $N$, but also satisfies a very specific structural property related to repeated division by 2. The constraint is not just about being odd.

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493E - Sad Teacher

We are given a single student’s marks in two subjects: Physics and Chemistry. Each test case provides two integers representing these scores, and the task is simply to compute the student’s total score by adding them together.

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493A - Gym Plates

This failure is no longer about parsing or indexing. The code is now consistently producing a valid permutation-like construction, but it is solving the wrong problem.

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493D - To Be Named

We are given a string consisting of decimal digits. From this string we are allowed to build new strings by selecting some of its positions and then sorting the chosen characters. Every distinct result after sorting is considered a different object, and we call it a “TBN”.

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493B - Convarge To 1

We are given an array of integers. A global process runs repeatedly: at each step we look at the current array, pick its maximum value (and if several positions tie, we pick the leftmost one), then replace that value by dividing it by its largest prime factor.

Practice › Codeforces Solutions › 2023 ICPC HIAST Collegiate Programming Contest ›

CF 104493C - Tree Permutation

We are given a tree with $n$ nodes. The nodes are not just a structure, they represent tourist places connected by roads, and every road has the same cost of one step.