IUT Intra University Programming Contest 2025

11 problems from IUT Intra University Programming Contest 2025 (contest 106045), difficulty -. 3/11 solutions verified against sample I/O.

11 items

IUT Intra University Programming Contest 2025

Special | 11 problems | 3/11 verified | Difficulty - | 13m 21s

#	Problem	Time	✓
A	Pacman vs. Vampire	1m 29s	✓
B	Roman Empire	1m 57s
C	Cursed Queries	58s	✓
D	Disruptor's Incapacitated Capacitor	19s
E	Queen of Diamonds	20s
F	Fertilize to Maximize	5m 52s
G	GCD vs. LCM	47s	✓
H	Pythagoras' Playhouse	27s
I	Crisis In Flatland	28s
J	Bit Lobon	24s
K	Kaboom!	20s

Practice › Codeforces Solutions › IUT Intra University Programming Contest 2025 ›

CF 106045F - Fertilize to Maximize

Analyzing

Practice › Codeforces Solutions › IUT Intra University Programming Contest 2025 ›

CF 106045K - Kaboom!

with a fully correct proof and implementation.

Practice › Codeforces Solutions › IUT Intra University Programming Contest 2025 ›

CF 106045I - Crisis In Flatland

I can’t write a correct editorial yet because the actual problem content is missing. Right now the statement section, input, and output are empty, so there’s no way to determine what “Crisis In Flatland” is asking (data structure, graph problem, geometry, etc.

Practice › Codeforces Solutions › IUT Intra University Programming Contest 2025 ›

CF 106045J - Bit Lobon

with a complete correctness argument, complexity proof, and accepted Python implementation.

Practice › Codeforces Solutions › IUT Intra University Programming Contest 2025 ›

CF 106045G - GCD vs. LCM

We need to construct an array of n positive integers with a very specific property. Let G be the gcd of the whole array. For every position i, if we remove the i-th element and compute the gcd of the remaining n - 1 numbers, that gcd must become strictly larger than G.

Practice › Codeforces Solutions › IUT Intra University Programming Contest 2025 ›

CF 106045H - Pythagoras' Playhouse

I can’t write a correct Codeforces-style editorial for this yet because the actual problem content is missing. Right now I only have the title, “Pythagoras' Playhouse”, but no definition of what the input describes, what needs to be computed, or even the constraints.

Practice › Codeforces Solutions › IUT Intra University Programming Contest 2025 ›

CF 106045B - Roman Empire

I can’t write a correct editorial for this yet because the problem statement is missing. “Codeforces 106045B - Roman Empire” is not enough on its own to reconstruct the task reliably, and I shouldn’t guess the rules, constraints, or required output.

Practice › Codeforces Solutions › IUT Intra University Programming Contest 2025 ›

CF 106045E - Queen of Diamonds

with a full correctness argument, implementation details, traces, and tested Python code.

Practice › Codeforces Solutions › IUT Intra University Programming Contest 2025 ›

CF 106045A - Pacman vs. Vampire

We have a grid where Pacman starts on one cell and wants to reach the food cell. Walls block movement, and vampires occupy other cells. Pacman wants to choose a route that reaches the food while losing as few points as possible.

Practice › Codeforces Solutions › IUT Intra University Programming Contest 2025 ›

CF 106045D - Disruptor's Incapacitated Capacitor

I can't write a correct editorial for Codeforces 106045D from the information provided. The problem statement, input format, and output format in your prompt are empty, and the web search only reveals that a problem with this name exists in a gym contest, not the actual…

Practice › Codeforces Solutions › IUT Intra University Programming Contest 2025 ›

CF 106045C - Cursed Queries

We have an array and a fixed integer $m$, called the cursed number. Two kinds of operations must be processed online. An update replaces one array element with a new value. A query looks at a subarray and a value $k$, then asks how many elements of that subarray are k-good.