TheForces Round #31 (Div2.9-Forces)

7 problems from TheForces Round #31 (Div2.9-Forces) (contest 105245), difficulty -. 0/7 solutions verified against sample I/O.

7 items

TheForces Round #31 (Div2.9-Forces)

Special | 7 problems | 0/7 verified | Difficulty - | 12m 10s

#	Problem	Time
A	King Supremacy	1m 44s
B	Circular Cone	1m 18s
C	Super Pair	1m 17s
D	Permutational Mex	2m 4s
E	XOR Priority	1m 58s
F	Count via Construct	1m 53s
G	Multiple Game	1m 56s

Practice › Codeforces Solutions › TheForces Round #31 (Div2.9-Forces) ›

CF 105245C - Super Pair

We are given a tree with $n$ nodes. The task is to consider every unordered pair of distinct nodes $(u, v)$ that is not already connected by an edge in the input tree, and decide whether adding a direct edge between them preserves a very strong structural property: after…

Practice › Codeforces Solutions › TheForces Round #31 (Div2.9-Forces) ›

CF 105245G - Multiple Game

Two players play on a pair of positive integers, and each move consists of choosing one number and reducing the other by any positive multiple of it, as long as the result stays non-negative.

Practice › Codeforces Solutions › TheForces Round #31 (Div2.9-Forces) ›

CF 105245F - Count via Construct

We are asked to count how many binary matrices of size $n times n$ satisfy two global constraints that are imposed in a very asymmetric way across rows and columns. Each row has a condition on the AND of all its entries.

Practice › Codeforces Solutions › TheForces Round #31 (Div2.9-Forces) ›

CF 105245E - XOR Priority

We are given an array and every adjacent pair can be connected either by addition or XOR. Each choice produces one expression, so there are $2^{n-1}$ expressions. However, the value of an expression is not computed in the usual left-to-right manner.

Practice › Codeforces Solutions › TheForces Round #31 (Div2.9-Forces) ›

CF 105245D - Permutational Mex

We are given a desired value of a function computed from a permutation of numbers from 0 to n-1. For any permutation, we look at every prefix and compute the MEX of that prefix, then sum all those MEX values.

Practice › Codeforces Solutions › TheForces Round #31 (Div2.9-Forces) ›

CF 105245A - King Supremacy

We are given an $n times m$ grid where each cell behaves like a chessboard square colored by parity: a cell is white when the sum of its coordinates is even and black otherwise.

Practice › Codeforces Solutions › TheForces Round #31 (Div2.9-Forces) ›

CF 105245B - Circular Cone

We are given a circular arrangement of $n$ sectors, and initially each sector contains exactly one cone. The goal is to move all cones so that they end up stacked in a single chosen sector.