Krosh Kaliningrad Contest 2

10 problems from Krosh Kaliningrad Contest 2 (contest 103451), difficulty -. 3/10 solutions verified against sample I/O.

10 items

Krosh Kaliningrad Contest 2

Special | 10 problems | 3/10 verified | Difficulty - | 6m 20s

#	Problem	Time	✓
A	Game	26s
B	Sum of sums	1m 9s	✓
C	Krosh and paths	28s
D	Krosh and powers of two	25s
E	One more splitting problem	27s
F	Krosh and series sum 2	23s
G	Krosh and permutation and expected number	55s	✓
H	Krosh and permutation	54s	✓
I	Krosh and bit operations	34s
J	Number	39s

Practice › Codeforces Solutions › Krosh Kaliningrad Contest 2 ›

CF 103451J - Number

I can’t write a correct Codeforces editorial for 103451J - Number because the actual problem statement (input/output definition and constraints) is missing from your prompt.

Practice › Codeforces Solutions › Krosh Kaliningrad Contest 2 ›

We are given an array of non-negative integers, and a recursive operation that repeatedly “expands” it into a new value. At the base level, when the level is zero, the value is simply the sum of all elements in the array.

Practice › Codeforces Solutions › Krosh Kaliningrad Contest 2 ›

CF 103451I - Krosh and bit operations

I can’t write a correct Codeforces editorial for this problem as-is because the actual statement is missing. Right now we only have the title “Krosh and bit operations”, but no description of: what the input represents, what operations are performed, or what needs to be…

Practice › Codeforces Solutions › Krosh Kaliningrad Contest 2 ›

CF 103451H - Krosh and permutation

We are given a single integer n, and two players alternate moves on it. On each move, the player looks at the current number and either reduces it by one or halves it with floor division.

Practice › Codeforces Solutions › Krosh Kaliningrad Contest 2 ›

CF 103451G - Krosh and permutation and expected number

We are working with permutations of the numbers from 1 to n, chosen uniformly at random. For any interval [l, r], we compute a value by starting from p[l] and repeatedly applying modulo with the next elements: we replace the current value x by x mod p[i] as we extend the…

Practice › Codeforces Solutions › Krosh Kaliningrad Contest 2 ›

Krosh Kaliningrad Contest 2

Krosh Kaliningrad Contest 2

CF 103451J - Number

CF 103451B - Sum of sums

CF 103451I - Krosh and bit operations

CF 103451H - Krosh and permutation

CF 103451G - Krosh and permutation and expected number

CF 103451F - Krosh and series sum 2

CF 103451E - One more splitting problem

CF 103451D - Krosh and powers of two

CF 103451C - Krosh and paths

CF 103451A - Game