Udmurt SU Contest 2011

11 problems from Udmurt SU Contest 2011 (contest 104326), difficulty -. 5/11 solutions verified against sample I/O.

11 items

Udmurt SU Contest 2011

Special | 11 problems | 5/11 verified | Difficulty - | 15m 8s

#	Problem	Time	✓
A	Forgotten Numbers	32s
B	Colored Ring	1m 57s
C	Christopher Robin is Learning Sorting Permutations	1m 10s	✓
D	Clever Plan	1m 35s	✓
E	Visiting	1m 34s	✓
F	Repeating b-ary	1m 12s	✓
G	Christopher Robin is Learning Object-oriented Programming	1m 29s
H	Expotition	1m 15s	✓
I	Wrong Sort of Bees	1m 31s
J	Maximal Sum	1m 19s
K	Leapfrog	1m 34s

Practice › Codeforces Solutions › Udmurt SU Contest 2011 ›

CF 104326K - Leapfrog

We are given a line of people, each occupying an integer coordinate on a number line. Each person is labeled from 1 to n, and their label stays attached to them throughout the process, even if their position changes. We are allowed to perform an operation called a leapfrog move.

Practice › Codeforces Solutions › Udmurt SU Contest 2011 ›

CF 104326J - Maximal Sum

We are given a multiset of positive integers, each containing at most six decimal digits. From this list we are allowed to pick numbers repeatedly and form a sequence of length up to 108 elements. The score of a chosen sequence is not computed by normal addition.

Practice › Codeforces Solutions › Udmurt SU Contest 2011 ›

CF 104326I - Wrong Sort of Bees

We observe a bee moving in the same plane as Pooh while Pooh travels in a straight line with constant speed. From a fixed external frame, Pooh is simply a point moving linearly.

Practice › Codeforces Solutions › Udmurt SU Contest 2011 ›

CF 104326H - Expotition

We are given a group of people, each identified by a number from 1 to n. Between some pairs of people there are constraints describing how they tolerate each other in a potential expedition group. The constraints come in two forms.

Practice › Codeforces Solutions › Udmurt SU Contest 2011 ›

CF 104326G - Christopher Robin is Learning Object-oriented Programming

We are given a collection of objects where each object has a numeric value and a fixed ordered list of references to other objects. The references form a directed structure, and this structure can include cycles.

Practice › Codeforces Solutions › Udmurt SU Contest 2011 ›

CF 104326F - Repeating b-ary

We are looking at the representation of a fraction, specifically $frac{1}{x}$, but written in base $b$ instead of base 10. When you expand a rational number in any base, its fractional part eventually becomes periodic.

Practice › Codeforces Solutions › Udmurt SU Contest 2011 ›

CF 104326E - Visiting

We are given a directed graph where each house is a node and each existing trackway is a one-way edge. Pooh can only travel along edges in their given direction.

Practice › Codeforces Solutions › Udmurt SU Contest 2011 ›

CF 104326D - Clever Plan

We are given a system with two characters sharing a fixed number of identical honey pots. Initially, the pots are split randomly between them, but only splits where both sides receive at least one pot are allowed.

Practice › Codeforces Solutions › Udmurt SU Contest 2011 ›

CF 104326B - Colored Ring

We are working on a circular board split into $k$ labeled sectors arranged clockwise. Each number from $1$ to $n$ must be placed on a distinct sector, and the final configuration must respect a strict reading order: if you start from the sector containing $1$ and walk…

Practice › Codeforces Solutions › Udmurt SU Contest 2011 ›

CF 104326C - Christopher Robin is Learning Sorting Permutations

We are given a deterministic variant of quicksort where the partition step is written in a very specific way and depends on a pre-chosen sequence of pivot indices produced by repeated calls to a random generator.

Practice › Codeforces Solutions › Udmurt SU Contest 2011 ›

CF 104326A - Forgotten Numbers

I can’t write a correct editorial for Codeforces 104326A without the actual problem statement. Right now your prompt only includes formatting requirements, but the core information (what the input is, what the output means, and what the task is) is missing.