TheForces Round #13 (Boombastic-Forces)

7 problems from TheForces Round #13 (Boombastic-Forces) (contest 104349), difficulty -. 1/7 solutions verified against sample I/O.

7 items

TheForces Round #13 (Boombastic-Forces)

Special | 7 problems | 1/7 verified | Difficulty - | 9m 44s

#	Problem	Time	✓
A	Human Readable	1m 25s
B	Least SigDig	1m 29s
C	Super Binary Numbers	1m 16s
D	Yet another permutation problem	1m 22s
E	Shift in TheForces	1m 7s	✓
F	Make Zero	1m 29s
G	Permutation Removal	1m 36s

Practice › Codeforces Solutions › TheForces Round #13 (Boombastic-Forces) ›

CF 104349G - Permutation Removal

We are given a permutation of size $n$, where $n$ is even. The array starts as a full ordering of numbers from $1$ to $n$, but the order is arbitrary. The process repeatedly removes the array in pairs.

Practice › Codeforces Solutions › TheForces Round #13 (Boombastic-Forces) ›

CF 104349F - Make Zero

We are given a binary string where each character is either 0 or 1. The only allowed move is to pick two positions containing 1s such that there is at least one character between them, and every character in between is 0.

Practice › Codeforces Solutions › TheForces Round #13 (Boombastic-Forces) ›

CF 104349D - Yet another permutation problem

We are given two permutations of the same set of numbers from 1 to n. Each player owns one array, and in a move a player is allowed to delete any single element from their own array.

Practice › Codeforces Solutions › TheForces Round #13 (Boombastic-Forces) ›

CF 104349E - Shift in TheForces

We are given a string s of length n. From this string, we can perform a rotation operation: choose a split position k, remove the prefix s[0:k], and append it to the end. This produces a cyclic shift of the string.

Practice › Codeforces Solutions › TheForces Round #13 (Boombastic-Forces) ›

CF 104349B - Least SigDig

We are given a sequence of independent test cases. Each test case provides two integers, $n$ and $m$, and we conceptually form the number $n cdot 245^m$. The task is not to compute this full value, but only to determine its last digit in base 10.

Practice › Codeforces Solutions › TheForces Round #13 (Boombastic-Forces) ›

CF 104349A - Human Readable

We are given a raw file size measured in bytes, and we must display it in a compact “human-readable” format using only three possible units: bytes (B), kibibytes (KiB), and mebibytes (MiB).

Practice › Codeforces Solutions › TheForces Round #13 (Boombastic-Forces) ›

CF 104349C - Super Binary Numbers

We are given a sequence of small integers, each independent from the others. For every number, we inspect how it looks in three different numeral systems: base 10 (usual decimal form), base 2 (binary form), and base 16 (hexadecimal form).