SVU-HIAST CPC 2025

14 problems from SVU-HIAST CPC 2025 (contest 106094), difficulty -. 4/14 solutions verified against sample I/O.

14 items

SVU-HIAST CPC 2025

Special | 14 problems | 4/14 verified | Difficulty - | 12m 30s

#	Problem	Time	✓
A	Matrix Bel Lotus	34s
B	Elkataeb Eltabseemeah	23s
C	Yum Yum Numbers	40s	✓
D	The Red Herring Fallacy	21s
E	Max Mex Bamboza	5m 18s
F	Hate-matrix Potter	26s
G	How did we get here?	48s	✓
H	You delete matrices I delete memories	22s
I	Ammar is back electricity is not	39s
J	Let the tree fall	38s	✓
K	3awdat al3lakat	31s
L	Darabona bel Interactive!!!	25s
M	Ahlan Ahlan bel3eed	1m 5s	✓
N	A-to-B-Kedavra	20s

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094E - Max Mex Bamboza

Codeforces 106094E: Max Mex Bamboza

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094M - Ahlan Ahlan bel3eed

We are given a fixed string of lowercase letters. The string changes over time through point updates, but the structure of the problem does not depend on how the string was built, only on its current state when each query is asked.

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094N - A-to-B-Kedavra

I can’t reliably reconstruct Codeforces 106094N - A-to-B-Kedavra from the title alone, and writing a correct editorial without the actual statement would risk inventing constraints and logic that don’t match the problem.

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094K - 3awdat al3lakat

I can’t reliably write a correct Codeforces editorial for “106094K - 3awdat al3lakat” because the problem statement (input/output definition and constraints) is missing.

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094L - Darabona bel Interactive!!!

Sure-please send the Codeforces problem statement (or at least the link / full text). Once I have it, I’ll write a proper competitive programming editorial with: - Problem summary - Key observations / intuition - Step-by-step solution - Proof of correctness - Complexity…

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094J - Let the tree fall

We are given a straight line of trees placed at increasing positions along a street. Every tree has the same height $h$.

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094I - Ammar is back electricity is not

I can’t write a correct editorial for that problem yet because the actual problem statement is missing from your message.

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094G - How did we get here?

The problem describes an infinite grid of integer coordinates where cells are classified by the value of the Chebyshev radius, meaning a cell belongs to layer $k$ if $max( Movement is normally allowed in the four cardinal directions, but stepping into a wall cell is forbidden.

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094H - You delete matrices I delete memories

I can’t write a correct, meaningful editorial for this yet because the problem statement is missing. “Codeforces 106094H - You delete matrices I delete memories” is referenced, but there are no details about: what the input matrix represents, what operations are allowed…

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094F - Hate-matrix Potter

I can’t produce a correct editorial for this yet because the actual problem statement is missing. “Codeforces 106094F - Hate-matrix Potter” isn’t something I can reliably reconstruct from the title alone, and guessing would almost certainly lead to inventing…

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094D - The Red Herring Fallacy

I don’t have the actual problem statement for Codeforces 106094D - The Red Herring Fallacy in your prompt, and without it I’d be forced to guess the task, which would make the editorial unreliable.

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094C - Yum Yum Numbers

We are given a multiset of numbers, each representing a “flavor score” of a candy. The task is to repeatedly combine these numbers into larger values using a fixed rule: we pick two available numbers, merge them into a single new number equal to their sum, and repeat until…

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094A - Matrix Bel Lotus

The problem gives a 5 by 5 grid containing exactly one cell with the value 1 and all other cells containing 0. A move consists of swapping two neighboring rows or swapping two neighboring columns.

Practice › Codeforces Solutions › SVU-HIAST CPC 2025 ›

CF 106094B - Elkataeb Eltabseemeah

I can’t write a correct editorial for this yet because the actual problem statement is missing from your prompt. Right now I only have the title “106094B - Elkataeb Eltabseemeah”, but no description of the task, input format, constraints, or samples.