ShellBeeHaken Presents Intra SUST Programming Contest 2024 - Replay
13 problems from ShellBeeHaken Presents Intra SUST Programming Contest 2024 - Replay (contest 105198), difficulty -. 4/13 solutions verified against sample I/O.
ShellBeeHaken Presents Intra SUST Programming Contest 2024 - Replay
Special | 13 problems | 4/13 verified | Difficulty - | 19m 59s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Monke's Favourite Function | 2m 9s | ||||
| B | 21---0? | 57s | ✓ | |||
| C | Alpha Beta | 2m | ✓ | |||
| D | Geometry Class | 1m 58s | ||||
| E | Jor Shongkot | 1m 22s | ||||
| F | Not A Giveaway | 1m 22s | ||||
| G | Surprise Gift | 1m 26s | ✓ | |||
| H | Stupid Game | 1m 32s | ||||
| I | Optimal Tree Exploration | 1m 25s | ||||
| J | Monke, Potato and Their Knight Game | 1m 5s | ||||
| K | Center of Attraction? | 2m 21s | ||||
| L | Kalopsia Sequence | 1m 27s | ||||
| M | Too Easy? | 55s | ✓ |
CF 105198K - Center of Attraction?
We are given a line of n = b + g positions. Exactly g of these positions are assigned to girls, and the remaining b positions are boys. This means every valid configuration is simply a choice of which g indices among 1..n contain girls.
CF 105198L - Kalopsia Sequence
We are maintaining a binary string of parentheses where each character is either an opening or closing bracket. The string changes over time, and after each update we may need to answer whether a chosen substring forms a valid regular bracket sequence.
CF 105198M - Too Easy?
The grid is infinite, and each test case describes a starting tile and a destination tile. A move changes exactly one coordinate by one unit.
CF 105198J - Monke, Potato and Their Knight Game
The board is infinite, so the only information that matters is the relative position between the starting square and the chosen destination square. For every test case, we are given two coordinates for the knight's initial position and two coordinates for the target position.
CF 105198I - Optimal Tree Exploration
We are given a rooted tree where each node carries a numeric value. Every query gives two starting nodes, one for Alice and one for Bob. From their respective starting points, each person is allowed to move only downward along parent to child edges.
CF 105198H - Stupid Game
We are given a circular arrangement of n balls. Each ball initially has value 1, and two players alternate removing one ball per turn starting with player X. When a ball is removed, its value is added to the current player’s score.
CF 105198G - Surprise Gift
We need build an n x n grid of positive integers. The grid is not given, so the task is purely constructive: we can choose any values as long as every row sum, every column sum, and the two diagonal sums are powers of two. The input contains only the size of the grid.
CF 105198F - Not A Giveaway
Each test gives a target amount of “energy units” measured in lit segments on a 7-segment display. Every decimal digit consumes a fixed number of segments when lit.
CF 105198E - Jor Shongkot
We are given an array of length $n$, where $n$ is odd, and we are allowed to repeatedly apply a very unusual global operation: choose a positive integer $x$, and XOR every element of the array with $x$ in one shot.
CF 105198D - Geometry Class
Sure. Please provide the Codeforces problem statement (including constraints, examples, and any notes), and I’ll write a competitive programming editorial with: - Problem restatement - Key observations - Detailed derivation of the algorithm - Proof of correctness -…
CF 105198A - Monke's Favourite Function
We are given a function defined on integers x interpreted through their binary representation. Each integer corresponds to a set of bit positions, and every number y ≤ x with y & x = y is exactly a submask of x, meaning it only uses bits that are already present in x.
CF 105198C - Alpha Beta
We are given a string of length $n$ made of lowercase English letters. Instead of treating the string as fixed character positions, we are allowed to “select” some occurrences of each letter and organize these selected indices into 26 groups, one per letter.
CF 105198B - 21---0?
We are given a sequence of daily solve counts indirectly. The original array contains how many problems were solved on each day, but only the sum of the recent days is provided.