TheForces Round #15 (Yummy-Forces)

5 problems from TheForces Round #15 (Yummy-Forces) (contest 104408), difficulty -. 1/5 solutions verified against sample I/O.

5 items

TheForces Round #15 (Yummy-Forces)

Special | 5 problems | 1/5 verified | Difficulty - | 8m 53s

#	Problem	Time	✓
A	Cool Strings	2m
B	Gaz Map	1m 23s
C	Binary Flip	1m 34s
D	Attack Plan	1m 25s	✓
E	Sixty Nine	2m 31s

Practice › Codeforces Solutions › TheForces Round #15 (Yummy-Forces) ›

CF 104408E - Sixty Nine

We are given an array of integers and a very unusual way to modify it. Each move lets us pick either a prefix or a suffix and subtract 1 from every element in that chosen segment. We can repeat these moves any number of times, and we are allowed to drive values below zero.

Practice › Codeforces Solutions › TheForces Round #15 (Yummy-Forces) ›

CF 104408D - Attack Plan

We are given an $n times n$ grid that contains exactly one soldier in every row and every column. This structure is equivalent to a permutation: in column $i$, the soldier is placed at row $pi$.

Practice › Codeforces Solutions › TheForces Round #15 (Yummy-Forces) ›

CF 104408A - Cool Strings

Right now I can’t produce a correct editorial because the problem content is essentially missing. For Codeforces 104508B - Bogosort, you only provided: and empty input/output sections.

Practice › Codeforces Solutions › TheForces Round #15 (Yummy-Forces) ›

CF 104408C - Binary Flip

We are given several binary strings, all of the same length. On each move, we pick one of these strings and choose a prefix starting at position 1, then flip every bit in that prefix. Flipping means turning 0 into 1 and 1 into 0.

Practice › Codeforces Solutions › TheForces Round #15 (Yummy-Forces) ›

CF 104408B - Gaz Map

The city is drawn on a plane, but movement is restricted to a fixed network of streets. There are the two coordinate axes, meaning you can move freely along the x-axis and y-axis, and there are also infinitely many concentric circular roads centered at the origin, one for each…