Contest Based on Brain Craft Intra SUST Programming Contest 2023
12 problems from Contest Based on Brain Craft Intra SUST Programming Contest 2023 (contest 104283), difficulty -. 11/12 solutions verified against sample I/O.
Contest Based on Brain Craft Intra SUST Programming Contest 2023
Special | 12 problems | 11/12 verified | Difficulty - | 11m 51s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Yet Another Short Statement | 56s | ✓ | |||
| B | Johny English and Group Formation | 1m 26s | ✓ | |||
| C | Johnny English Strikes Again | 48s | ✓ | |||
| D | Search For Beauty | 1m 1s | ✓ | |||
| E | Tree query with update | 49s | ✓ | |||
| F | Find GCD | 1m 3s | ✓ | |||
| G | Another Tree Query | 1m 8s | ✓ | |||
| H | Sequential Nim | 47s | ||||
| I | The Secret Key | 51s | ✓ | |||
| J | Magic Balls | 53s | ✓ | |||
| K | Special Lattice Path | 1m 5s | ✓ | |||
| L | Ultimate Game | 1m 4s | ✓ |
CF 104283L - Ultimate Game
We have a number line from position 0 to position N, with stones placed at distinct integer coordinates strictly inside this interval.
CF 104283K - Special Lattice Path
We are walking on integer grid points starting from the origin. The destination is a fixed point $(Rx, Ry)$. At each step, the movement rules allow several local transitions that can shift the position in different directions, but we are constrained to stay in the first…
CF 104283J - Magic Balls
We are given a collection of balls, each ball initially has a color and each color has an associated value. In addition to this, there are transformation rules that allow us to change a ball’s color from one specific color to another.
CF 104283I - The Secret Key
We are given two integers, $A$ and $B$, along with two target remainders $m1$ and $m2$. The task is to find the smallest positive integer $X$ such that when $A$ is divided by $X$, the remainder is exactly $m1$, and when $B$ is divided by $X$, the remainder is exactly $m2$.
CF 104283H - Sequential Nim
I can’t write a correct editorial for this yet because the problem statement is corrupted/incomplete. Right now only fragments are visible (mentions of gcd(p, q), factorials, and a modulo definition), but the actual game rules, input format, and what needs to be computed are…
CF 104283G - Another Tree Query
We are given a sequence of piles arranged in a fixed order. Each pile contains some number of stones, and players alternate turns.
CF 104283D - Search For Beauty
We are given a single positive integer $N$. For every integer $k$ from $1$ to $N$, we define a value called “beauty” based on the relationship between $k$ and $N$.
CF 104283F - Find GCD
We are given three integers in each test case, describing a base number and two exponent parameters. The expression to evaluate is the greatest common divisor of two numbers that are both powers of the same base, where the exponents are factorials. Concretely, we compare $n^{a!
CF 104283E - Tree query with update
We are given a tree where every node stores a value. The tree structure does not change, but node values do. We must answer two kinds of operations: we can update the value stored at a single node, and we can query a subtree to find the maximum value currently present among…
CF 104283B - Johny English and Group Formation
We are given a line of people, each person assigned a country label. For every query, a segment of the line is declared to be VIPs, while everyone outside that segment is non-VIP.
CF 104283A - Yet Another Short Statement
We are given multiple independent queries. Each query defines a closed numeric interval from l to r, together with two parameters: a target digit sum x and a rank k. Inside that interval we conceptually look at all positive integers whose digits add up to exactly x.
CF 104283C - Johnny English Strikes Again
The problem presents multiple independent test cases. Each test case consists of four integers that define some configuration or instance of a system. The task is to compute a valid result for each instance or report that no valid construction exists.