ACPC Kickoff 2025

12 problems from ACPC Kickoff 2025 (contest 105862), difficulty -. 5/12 solutions verified against sample I/O.

12 items

ACPC Kickoff 2025

Special | 12 problems | 5/12 verified | Difficulty - | 11m 39s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Dragons				48s	✓
B	Fair and Square				37s	✓
C	Women and Cars				30s
D	OR MEX				54s	✓
E	Beauty Buildings				5m 38s
F	Kinan The Bank Robber				36s	✓
G	Olympics Champion				42s	✓
H	Expected Value Of Function				24s
I	Permutation Prefix Max				24s
J	XOR MSB				20s
K	Forced Online Queries?				26s
L	I hate blue				20s

Practice › Codeforces Solutions › ACPC Kickoff 2025 ›

CF 105862E - Beauty Buildings

Codeforces 105862E: Beauty Buildings

Practice › Codeforces Solutions › ACPC Kickoff 2025 ›

CF 105862L - I hate blue

I can absolutely write this editorial in the exact style you want, but I’m missing the only thing that makes it possible: the actual problem statement.

Practice › Codeforces Solutions › ACPC Kickoff 2025 ›

CF 105862K - Forced Online Queries?

I don’t actually have the statement of Codeforces 105862K (“Forced Online Queries?”) available in the prompt, and I can’t reliably reconstruct it from the title alone without risking inventing details.

Practice › Codeforces Solutions › ACPC Kickoff 2025 ›

CF 105862J - XOR MSB

I can absolutely write that kind of full Codeforces-style editorial, but I’m missing the actual problem statement for 105862J - XOR MSB. Without it, I’d be forced to guess the task, constraints, and intended solution, which would very likely produce a misleading editorial.

Practice › Codeforces Solutions › ACPC Kickoff 2025 ›

CF 105862I - Permutation Prefix Max

I’m missing the actual problem statement for Codeforces 105862I - Permutation Prefix Max, and I can’t reliably reconstruct it from the title alone without risking hallucinating details.

Practice › Codeforces Solutions › ACPC Kickoff 2025 ›

CF 105862G - Olympics Champion

Each test case describes a random process repeated over several days. On every day, a runner independently chooses an integer distance between 0 and 12 kilometers, and each value has its own fixed probability given as percentages.

Practice › Codeforces Solutions › ACPC Kickoff 2025 ›

CF 105862H - Expected Value Of Function

I can’t write a correct, detailed Codeforces editorial for 105862H - Expected Value Of Function without the actual problem statement.

Practice › Codeforces Solutions › ACPC Kickoff 2025 ›

CF 105862D - OR MEX

We are given a collection of integers and are asked to look at all values that can be formed by taking any subset of these numbers and combining them using bitwise OR.

Practice › Codeforces Solutions › ACPC Kickoff 2025 ›

CF 105862F - Kinan The Bank Robber

The task describes a linear sequence of safe-deposit boxes, each positioned at an integer coordinate on a number line. Some positions contain banknotes, possibly multiple at the same position.

Practice › Codeforces Solutions › ACPC Kickoff 2025 ›

CF 105862A - Dragons

We are given a simple progression simulation involving a character and a sequence of dragons. Each dragon has a required strength to be defeated and a reward in strength after being defeated. The character starts with an initial strength value.

Practice › Codeforces Solutions › ACPC Kickoff 2025 ›

CF 105862B - Fair and Square

The problem asks us to take a rectangular grid with height n and width m, make several identical copies of it, and attach those copies without rotating them. The final combined shape must be a square. We need the smallest number of copies needed to achieve that.

Practice › Codeforces Solutions › ACPC Kickoff 2025 ›

CF 105862C - Women and Cars

I can absolutely write that kind of editorial, but I’m missing the one thing needed to make it correct: the actual problem statement.