The 2022 Zhejiang University City College Freshman Programming Contest
12 problems from The 2022 Zhejiang University City College Freshman Programming Contest (contest 104101), difficulty -. 12/12 solutions verified against sample I/O.
The 2022 Zhejiang University City College Freshman Programming Contest
Special | 12 problems | 12/12 verified | Difficulty - | 9m 48s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | OP | 40s | ✓ | |||
| B | Steel of Heart | 50s | ✓ | |||
| C | Add 9 Zeros | 46s | ✓ | |||
| D | Cutting with Lines \u2160 | 49s | ✓ | |||
| E | Cutting with Lines \u2161 | 1m 1s | ✓ | |||
| F | Survivor | 51s | ✓ | |||
| G | Red Black Tree | 44s | ✓ | |||
| H | Beautiful String | 46s | ✓ | |||
| I | Digit Problem | 52s | ✓ | |||
| J | Simple Game | 44s | ✓ | |||
| K | Bit | 59s | ✓ | |||
| L | Elden Ring | 46s | ✓ |
CF 104101L - Elden Ring
We are given two independent circular arrangements, each containing n positions. Every position initially hosts a unique “old man” identified by an integer label from 1 to 2n.
CF 104101K - Bit
We are given a fixed sequence of bitwise operations that is always applied to a starting integer. The starting value is not given; instead, we are free to choose it, but it must lie in a range from zero up to some limit r.
CF 104101J - Simple Game
We are given a sequence of integers, and two players alternate taking one number at a time until the sequence is empty. Alice moves first. Each player accumulates the sum of the numbers they picked.
CF 104101I - Digit Problem
We are asked to construct two binary strings representing two non-negative integers, call them $x$ and $y$, both written with the same fixed length $n = a + b$. The strings are allowed to have leading zeros, so the length constraint is purely structural.
CF 104101H - Beautiful String
We are given a fixed alphabet consisting of the first 18 lowercase letters, from a to r. For each test case we receive a string s and a number n.
CF 104101G - Red Black Tree
We are given a triangular structure of nodes, arranged in rows. Row 1 has one node, row 2 has two nodes, and row i has i nodes. Each node at position (i, j) connects downward to two nodes: (i + 1, j) and (i + 1, j + 1).
CF 104101E - Cutting with Lines Ⅱ
We are given several infinite straight lines in the plane. From these lines, we are allowed to pick some subset and try to arrange them as the edges of a convex polygon.
CF 104101F - Survivor
We are given a group of fighters, each starting with some health value. Over time, every fighter steadily loses health at a fixed rate. Once a fighter’s health drops to zero or below at the end of some minute, that fighter is eliminated permanently and can no longer be helped.
CF 104101D - Cutting with Lines Ⅰ
We are given a rectangular region in the plane with corners at $(0,0)$, $(n,0)$, $(0,m)$, and $(n,m)$. Think of it as an empty rectangle. We then place $q$ axis-aligned line segments inside this rectangle.
CF 104101B - Steel of Heart
We are simulating a single game character whose health changes over time according to a chronological event log. The character starts with an initial health value and gains additional health whenever they level up.
CF 104101C - Add 9 Zeros
We are given a collection of problems, each characterized by a single integer value that represents how many trailing zeros its difficulty scale has in a power of ten.
CF 104101A - OP
The task is intentionally minimal. There is no input to process, no computation to perform, and no decision to make. The program is expected to produce a single fixed string on standard output.