EZ Programming Contest #1

9 problems from EZ Programming Contest #1 (contest 103150), difficulty -. 1/9 solutions verified against sample I/O.

9 items

EZ Programming Contest #1

Special | 9 problems | 1/9 verified | Difficulty - | 7m 38s

#	Problem	Time	✓
A	Addition Range Queries	52s	✓
B	Arrowing Process	1m 18s
C	EZPC Sort	36s
D	Moving Points	31s
E	o	28s
F	Palindromicity	28s
G	Segmentation Fault	2m 26s
H	William Tell	28s
I	X-OR XOR	31s

Practice › Codeforces Solutions › EZ Programming Contest #1 ›

CF 103150G - Segmentation Fault

Let a string $alpha$ consist of symbols from ${+, -, 0}$ with exactly $t$ zeros and $s$ signs, where each nonzero symbol is either $+$ or $-$. An R-block is a substring of the form $-^k+$, $k ge 0$, that is immediately preceded by $0$ and not followed by $-$.

Practice › Codeforces Solutions › EZ Programming Contest #1 ›

CF 103150I - X-OR XOR

I don’t have the actual statement for Codeforces 103150I “X-OR XOR”, so I can’t safely derive a correct editorial yet. With XOR-style problems especially, small missing details completely change the intended solution (range vs. prefix, updates vs.

Practice › Codeforces Solutions › EZ Programming Contest #1 ›

CF 103150H - William Tell

The problem section is empty, so there isn’t enough information to write a correct editorial. For a Codeforces editorial, I need at least the full statement (or at minimum: input format, output format, constraints, and a description of the task).

Practice › Codeforces Solutions › EZ Programming Contest #1 ›

CF 103150F - Palindromicity

I can write the full 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 › EZ Programming Contest #1 ›

CF 103150E - o

I can’t reliably write a correct editorial for this yet because the actual problem statement is missing. Right now I only see “Codeforces 103150E - o” with empty input/output sections, which isn’t enough to reconstruct the task.

Practice › Codeforces Solutions › EZ Programming Contest #1 ›

CF 103150B - Arrowing Process

Let κt(N) be the leading parameter in the degree-$t$ combinatorial representation of $N$, so that κt(N) is the unique integer $nt$ satisfying $$binom{nt}{t} le N < binom{nt+1}{t}.

Practice › Codeforces Solutions › EZ Programming Contest #1 ›

CF 103150D - Moving Points

I’m missing the actual problem statement for Codeforces 103150D - Moving Points in your prompt. Right now the “Problem Statement / Input / Output” sections are empty, so I don’t have enough information to: - understand what is being computed, - derive the algorithm, - or…

Practice › Codeforces Solutions › EZ Programming Contest #1 ›

CF 103150A - Addition Range Queries

We are given an array of integers, and we repeatedly apply a very specific transformation to it. In one transformation step, every position is updated at the same time so that each element becomes the sum of all the other elements in the array, excluding itself.

Practice › Codeforces Solutions › EZ Programming Contest #1 ›

CF 103150C - EZPC Sort

The problem statement section is empty, so I don’t actually know what “EZPC Sort” is asking us to compute. Without the rules of the operation, input format, or what “sort” means in this context, any editorial would be guesswork and very likely incorrect.