The 18-th Beihang University Collegiate Programming Contest (BCPC 2023) - Final
9 problems from The 18-th Beihang University Collegiate Programming Contest (BCPC 2023) - Final (contest 104883), difficulty -. 8/9 solutions verified against sample I/O.
The 18-th Beihang University Collegiate Programming Contest (BCPC 2023) - Final
Special | 9 problems | 8/9 verified | Difficulty - | 7m 11s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | rnm\uff0c\u9000\u94b1\uff01 | 42s | ✓ | |||
| B | \u5965\u672f\u4e4b\u5c18 | 44s | ✓ | |||
| C | \u66f4\u5c0f\u4f46\u662f\u5f02\u6216\u4e4b\u540e\u81f3\u5c11\u6709 x \u4e2a 1 | 1m | ✓ | |||
| D | \u751f\u6d3b\u5728\u6811\u4e0a | 28s | ||||
| E | \u5b9d\u77f3\u5408\u6210 | 46s | ✓ | |||
| F | \u4e8c\u5206\u67e5\u627e | 53s | ✓ | |||
| G | What if ...? | 58s | ✓ | |||
| H | Rolling Star | 54s | ✓ | |||
| I | Would You Like Some Modulo? | 46s | ✓ |
CF 104883E - 宝石合成
We are given a sequence of gemstones, each with an integer level. The only operation allowed is to take a contiguous block of at least two identical levels and merge it into a single gemstone whose level increases by one.
CF 104883I - Would You Like Some Modulo?
We are given a sequence of large integers, and a range of values from L to R. For each integer x in this range, we repeatedly apply a modulo operation using the sequence A1, A2, ..., An in order.
CF 104883H - Rolling Star
We are given a total number of credits and two aggregated statistics computed over a hidden list of courses. Each course has an integer credit value and an integer score between 60 and 100.
CF 104883G - What if ...?
We are given a loop that runs over all integers from 1 to n. Inside the loop, there is a chained if-else structure with m conditions, producing m+1 possible branches.
CF 104883F - 二分查找
We are dealing with a hidden permutation of length $n$, where every integer from $1$ to $n$ appears exactly once.
CF 104883D - 生活在树上
This problem requires deriving and proving a constructive algorithm, together with a complete verified implementation.
CF 104883C - 更小但是异或之后至少有 x 个 1
We are given a large integer a written as a binary string, and a nonnegative integer x. We must construct another integer b that does not exceed a, and among all such valid b, we want the maximum possible value of b.
CF 104883B - 奥术之尘
Each account comes with a certain amount of “arcane dust”, and there is a fixed list of card decks, each requiring a specific dust cost to be fully crafted.
CF 104883A - rnm，退钱！
We are given a chronological log of a player’s account balance in a virtual currency system. Each record changes their balance in one of three ways: they either receive currency by paying real money, spend currency in the game, or do something irrelevant that does not affect…