AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred)
8 problems from AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) (contest 1302), difficulty -. 2/8 solutions verified against sample I/O.
AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred)
Div. 1 | 8 problems | 2/8 verified | Difficulty - | 41m 23s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Nash equilibrium | 299 | 6m 35s | |||
| B | DAG | constructive-algorithms | 156 | 2m 50s | ||
| C | Segment tree or Fenwick? | data-structures | 388 | 1m 46s | ✓ | |
| E | Amazing bitset | 51 | 9m 19s | |||
| F | Keep talking and nobody explodes -- easy | bitmasks, brute-force, expression-parsing | 76 | 6m 46s | ||
| G | Keep talking and nobody explodes -- medium | 23 | 5m 46s | |||
| H | Who needs suffix structures? | 10 | 1m 52s | ✓ | ||
| J | Keep talking and nobody explodes -- hard | 12 | 6m 29s |
CF 1302J - Keep talking and nobody explodes -- hard
We are given a lock described by a sequence of exactly 100 decimal digits. Think of it as a row of 100 small wheels, each showing a digit from 0 to 9.
CF 1302G - Keep talking and nobody explodes -- medium
We are given a fixed 5-digit lock state. Each digit can be incremented cyclically, so 9 wraps back to 0. Starting from an initial 5-digit configuration, we must apply a long, fixed sequence of conditional rules.
CF 1302E - Amazing bitset
We are given a binary string of length $n$, but instead of being fixed, each position is generated independently as a random bit: it becomes $1$ with probability $p = frac{a}{b}$ and $0$ with probability $1 - p$.
CF 1302F - Keep talking and nobody explodes -- easy
We are given a 5-digit lock state. Each digit behaves like a circular counter from 0 to 9, so increasing a digit by 1 means moving to the next digit and wrapping 9 back to 0. The process consists of a fixed sequence of 20 deterministic instructions.
CF 1302A - Nash equilibrium
We are working with a rectangular grid of numbers. Each cell behaves like a player in a two-dimensional game: it is compared vertically against its column and horizontally against its row.
CF 1302H - Who needs suffix structures?
We are given a sequence of length n. Although the statement talks about a string, the characters are represented by integers, and the alphabet is extremely large. The large alphabet size means we cannot rely on tricks that depend on a small number of distinct symbols.
CF 1302B - DAG
There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…
CF 1302C - Segment tree or Fenwick?
We are asked to maintain an array of integers that starts with all zeros and answer a series of queries. Each query is either an assignment, setting a specific element to a value, or a range sum query, asking for the sum of a contiguous subarray.