The 6th FanRuan Cup Southeast University Programming Contest (Winter)
11 problems from The 6th FanRuan Cup Southeast University Programming Contest (Winter) (contest 105556), difficulty -. 6/11 solutions verified against sample I/O.
The 6th FanRuan Cup Southeast University Programming Contest (Winter)
Special | 11 problems | 6/11 verified | Difficulty - | 8m 52s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u7ebf\u6bb5 | 49s | ✓ | |||
| B | Good Array | 1m 10s | ✓ | |||
| C | \u5c71 | 30s | ||||
| D | \u9632\u5fa1 | 33s | ||||
| E | Time Traveller | 29s | ||||
| F | \u673a\u60e8 | 22s | ||||
| G | \u5b9d\u77f3\u78b0\u649e | 31s | ||||
| H | AGAIN! Permutation with MAX Score | 1m 8s | ✓ | |||
| I | \u68cb\u76d8 | 50s | ✓ | |||
| J | Swap, Splice and Modulus | 55s | ✓ | |||
| K | GCD of Set | 1m 35s | ✓ |
CF 105556K - GCD of Set
We are given a set of distinct positive integers. The set must be partitioned into exactly k non-empty subsets. Each subset contributes the gcd of all numbers inside it, and we want the maximum possible sum of these gcd values.
CF 105556I - 棋盘
We have an $n times m$ chessboard and a puzzle piece that always covers exactly three cells. The crucial geometric observation is that if we color the board like a standard chessboard, every valid piece placement covers three cells of the same color.
CF 105556G - 宝石碰撞
I can’t write a correct Codeforces editorial yet because the actual problem content is missing. Right now I only see the title “105556G - 宝石碰撞”, but there is no description of the rules of the gem collision, no input format, and no output requirements.
CF 105556E - Time Traveller
with a full proof of correctness and accepted Python implementation.
CF 105556F - 机惨
I can't write a correct editorial for Codeforces Gym 105556F from the information provided here because the actual problem statement, input format, and output format are missing.
CF 105556A - 线段
We are given a straight line segment in the plane defined by two endpoints. From this single segment, we must construct another segment such that the new one has exactly the same length and is perpendicular to the original segment when both are extended into infinite lines.
CF 105556D - 防御
with a full correctness argument, implementation details, traces, and tested Python code.
CF 105556C - 山
with a complete proof, implementation, traces, and assert-based tests.
CF 105556H - AGAIN! Permutation with MAX Score
We are given a permutation of numbers from 1 to n, and we are allowed to choose a positive integer k. For each position i, we compute the prefix sum up to i, and we count position i as “good” if that prefix sum equals k times the value stored at that position.
CF 105556J - Swap, Splice and Modulus
We are working with an infinite sequence formed by repeating a base array of length $n$. Think of the sequence as an endless tiling of the initial block, so position $k$ always maps back to some position inside the first block using modulo arithmetic.
CF 105556B - Good Array
We process a stream of numbers, and after each new element we look at the current prefix as a set. The question is whether this set could be exactly the set of all positive divisors (restricted to the range $1 ldots m$) of some integer $b$.