TheForces Round #19 (Briefest-Forces)

6 problems from TheForces Round #19 (Briefest-Forces) (contest 104455), difficulty -. 2/6 solutions verified against sample I/O.

6 items

TheForces Round #19 (Briefest-Forces)

Special | 6 problems | 2/6 verified | Difficulty - | 10m 58s

#	Problem	Time	✓
A	Dice Game	2m 18s
B	K Integers	1m 5s	✓
C	Count Triples	1m 12s	✓
D	Tree Construction	1m 38s
E	Max Mobius Sum	2m 32s
F	Stack Sort	2m 13s

Practice › Codeforces Solutions › TheForces Round #19 (Briefest-Forces) ›

CF 104455F - Stack Sort

We start with $n$ separate stacks, and each stack contains exactly one integer. A single move consists of taking the top element of any stack and placing it on top of another stack.

Practice › Codeforces Solutions › TheForces Round #19 (Briefest-Forces) ›

We are working with a circular sequence of length $2n$, where position $1$ is adjacent to position $2n$. The array is naturally split into two halves: the first $n$ elements and the last $n$ elements, forming $n$ symmetric pairs $(i, i+n)$.

Practice › Codeforces Solutions › TheForces Round #19 (Briefest-Forces) ›

CF 104455A - Dice Game

Two players independently roll a pair of uniform integer “dice intervals” twice, then sum their two results. Alice uses the interval $[l1, r1]$ and Bob uses $[l2, r2]$.

Practice › Codeforces Solutions › TheForces Round #19 (Briefest-Forces) ›

CF 104455D - Tree Construction

We are asked to construct a tree on nodes labeled from 1 to n, where node 1 is fixed as the root. The quantity we care about is the sum of distances from the root to every leaf node, and this sum must equal a given target x.

Practice › Codeforces Solutions › TheForces Round #19 (Briefest-Forces) ›

CF 104455C - Count Triples

We are given three arrays of equal length, and each position contains a positive integer. From these arrays, we are not choosing elements in a constrained order or structure, we are simply forming independent triples by picking one index from each array.

Practice › Codeforces Solutions › TheForces Round #19 (Briefest-Forces) ›

CF 104455B - K Integers

We are asked whether it is possible to split a number $n$ into exactly $k$ positive integers such that their sum is exactly $n$, and at the same time all of them share a common divisor strictly greater than 1.

TheForces Round #19 (Briefest-Forces)

TheForces Round #19 (Briefest-Forces)

CF 104455F - Stack Sort

CF 104455E - Max Mobius Sum

CF 104455A - Dice Game

CF 104455D - Tree Construction

CF 104455C - Count Triples

CF 104455B - K Integers