HIAST Collegiate Programming Contest 2024

14 problems from HIAST Collegiate Programming Contest 2024 (contest 105223), difficulty -. 10/14 solutions verified against sample I/O.

14 items

HIAST Collegiate Programming Contest 2024

Special | 14 problems | 10/14 verified | Difficulty - | 30m 34s

# Problem Rating Tags Accepted Time ✓
A Levi Is Sad 52s ✓
B A Problem You Will Hate More Than Yourself 1m 8s ✓
C Bit And Segment 1m ✓
D Coconuting 51s ✓
E Lazy Fouad 5m 19s
F Fire Kings 5m 19s
G Subsubsequence 59s ✓
H Game with wife 1m ✓
I Fofo Loves Bitset 41s ✓
J Only Two 44s ✓
K Water Filling 47s ✓
L Geoland 1m 17s ✓
M Minimize Sum 5m 19s
N Larger but smaller! 5m 18s
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223N - Larger but smaller!

Codeforces 105223N: Larger but smaller!
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223M - Minimize Sum

Codeforces 105223M: Minimize Sum
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223L - Geoland

We are asked to decide whether we can place $n$ distinct lattice points in the plane and connect them in a cycle so that all edges have equal Euclidean length, the polygon is simple (no self-intersections), and no three consecutive vertices lie on a single straight line.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223F - Fire Kings

Codeforces 105223F: Fire Kings
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223E - Lazy Fouad

Codeforces 105223E: Lazy Fouad
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223K - Water Filling

We are given a rooted tree where each node represents a one-liter tank. Water can be poured into any chosen tank, but the filling does not stay local.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223J - Only Two

We are given an axis-aligned square and inside it several straight segments, each of which is either horizontal or vertical. The segments are strictly inside the square, but they may overlap or even coincide.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223I - Fofo Loves Bitset

We are given several independent strings, and for each one we must decide whether it contains a specific pattern, the word “bitset”, as a contiguous block inside it.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223H - Game with wife

We are given several independent test cases. Each test case describes a game state consisting of several piles of stones.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223G - Subsubsequence

We are given an array that changes over time. After each update, we are asked to compute a global quantity built in two layers. First, take any non-empty subsequence of the current array.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223D - Coconuting

We are given several test cases. In each test case, we receive an array of integers. Our task is to count how many pairs of positions $(i, j)$ with $i < j$ satisfy a very specific algebraic relationship between the values $ai$ and $aj$.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223B - A Problem You Will Hate More Than Yourself

We start with an existing tree on $n$ vertices. We are allowed to add new vertices and connect them with edges, but we are not allowed to create cycles, so the final structure must still be a tree. After these additions, the resulting tree must satisfy two structural conditions.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223C - Bit And Segment

We are given an array and for every position $i$, we want to count how many segments $[l, r]$ that include $i$ have a special property tied to bitwise AND.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › HIAST Collegiate Programming Contest 2024 ›

CF 105223A - Levi Is Sad

We are given a line of students, each with a fixed initial height. The school is unhappy with any student who is strictly shorter than both of their immediate neighbors. The first and last students are exempt because they only have one neighbor.
codeforces competitive-programming Jun 24, 2026