The 13th Shaanxi Provincial Collegiate Programming Contest

13 problems from The 13th Shaanxi Provincial Collegiate Programming Contest (contest 105891), difficulty -. 13/13 solutions verified against sample I/O.

13 items

The 13th Shaanxi Provincial Collegiate Programming Contest

Special | 13 problems | 13/13 verified | Difficulty - | 13m 19s

#	Problem	Time	✓
A	Color	52s	✓
B	Light	1m 14s	✓
C	gcd	52s	✓
D	Stock	1m 2s	✓
E	Printer	56s	✓
F	LOCK S	57s	✓
G	student	1m 12s	✓
H	candy	1m 9s	✓
I	magic	56s	✓
J	Win	1m 20s	✓
K	Welfare	54s	✓
L	easy	45s	✓
M	Nightmare	1m 10s	✓

Practice › Codeforces Solutions › The 13th Shaanxi Provincial Collegiate Programming Contest ›

CF 105891C - gcd

We are given two very large positive integers, a and b, and for each test case we must decide whether there exists another positive integer x (bounded by $10^{18}$) that simultaneously satisfies two conditions.

Practice › Codeforces Solutions › The 13th Shaanxi Provincial Collegiate Programming Contest ›

CF 105891E - Printer

We are asked to simulate a very constrained typing process that builds a target string in order, but with a twist: characters do not have to be appended only at the end of the current string.

Practice › Codeforces Solutions › The 13th Shaanxi Provincial Collegiate Programming Contest ›

CF 105891J - Win

We are given a fixed lowercase string, and we are allowed to insert up to k characters anywhere in it. Insertions are flexible: we can choose both the position and the character freely each time.

Practice › Codeforces Solutions › The 13th Shaanxi Provincial Collegiate Programming Contest ›

CF 105891L - easy

We are given an $n times n$ matrix where the values are filled in row-major order. The number in row $i$, column $j$ is simply $(i-1)cdot n + j$, so each row is a consecutive block of integers and every column picks one element from each block at a fixed offset.

Practice › Codeforces Solutions › The 13th Shaanxi Provincial Collegiate Programming Contest ›

CF 105891I - magic

We are given an integer array of length $n$, and a fixed parameter $k$. We are allowed to repeatedly apply an operation that chooses a center position $x$ such that there are at least $k$ elements on both sides of it.

Practice › Codeforces Solutions › The 13th Shaanxi Provincial Collegiate Programming Contest ›

CF 105891K - Welfare

There are two types of cows and two ways they can choose to receive grass. Each cow can choose option A or option B. If k cows choose A, then every A-cow receives x/k units of grass. If a cow chooses B, it simply receives y units.

Practice › Codeforces Solutions › The 13th Shaanxi Provincial Collegiate Programming Contest ›

CF 105891G - student

We are given a row of students, each with a fixed score. A teacher repeatedly selects a student and checks whether that student can be removed from the row.

Practice › Codeforces Solutions › The 13th Shaanxi Provincial Collegiate Programming Contest ›

CF 105891F - LOCK S

We are given a rooted tree with $n$ nodes, each node carrying a positive weight $vi$. Two players, Dawn and Tsuki, alternately “claim” nodes until one of them cannot make a legal move, at which moment the game immediately ends and both are considered to meet.

Practice › Codeforces Solutions › The 13th Shaanxi Provincial Collegiate Programming Contest ›

CF 105891D - Stock

We start with an initial value $v$, and we are given $n$ operations. Each operation is either an addition by some real number $xi$, or a multiplication by some factor $xi$. We are allowed to reorder these operations arbitrarily.

Practice › Codeforces Solutions › The 13th Shaanxi Provincial Collegiate Programming Contest ›

CF 105891A - Color

We are given a strip divided into n consecutive segments. Each segment already has an initial color, but that starting configuration does not really matter for the final goal except as a source of structure.

Practice › Codeforces Solutions › The 13th Shaanxi Provincial Collegiate Programming Contest ›

CF 105891M - Nightmare

We are given a line of $n$ positions. Each position has a fixed weight and an initial color, either black or white. The line is naturally divided into maximal consecutive segments of identical color, which we will call blocks. Time evolves in discrete steps.

Practice › Codeforces Solutions › The 13th Shaanxi Provincial Collegiate Programming Contest ›

CF 105891H - candy

We are given a binary string describing a day-by-day plan over $n$ days. On day $i$, the plan prescribes either eating a candy or avoiding it. If the character is 1, the mood increases by $+1$. If it is 0, the mood decreases by $-1$.

Practice › Codeforces Solutions › The 13th Shaanxi Provincial Collegiate Programming Contest ›

CF 105891B - Light

We are given a system of $n$ lamps, each currently either on or off, and $m$ switches. Each switch is wired to a subset of lamps. Pressing a switch flips the state of every lamp connected to it.