Southeast University 6th Programming Competition Competition (Winter, Novice Group) 东南大学第六届程序设计竞赛冬季赛（新手组）
11 problems from Southeast University 6th Programming Competition Competition (Winter, Novice Group) 东南大学第六届程序设计竞赛冬季赛（新手组） (contest 105575), difficulty -. 11/11 solutions verified against sample I/O.
Southeast University 6th Programming Competition Competition (Winter, Novice Group) 东南大学第六届程序设计竞赛冬季赛（新手组）
Special | 11 problems | 11/11 verified | Difficulty - | 9m 26s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u7edf\u8ba1\u9009\u624b | 52s | ✓ | |||
| B | A Typical Codeforces Round | 47s | ✓ | |||
| C | \u732b\u5a18\u9b54\u6cd5 | 45s | ✓ | |||
| D | Permutation with MAX Score | 52s | ✓ | |||
| E | \u5b89\u6392\u65f6\u95f4 | 48s | ✓ | |||
| F | \u5168\u80fd\u732b\u5a18\u7684\u70e6\u607c | 40s | ✓ | |||
| G | The Greatest War | 50s | ✓ | |||
| H | YiYi Loves Beautiful Number String | 48s | ✓ | |||
| I | \u5fc3\u610f\u65e0\u5411\uff0c\u524d\u7a0b\u6709\u5411 | 57s | ✓ | |||
| J | \u6211\u559c\u6b22\u56de\u6587\u4e32 | 58s | ✓ | |||
| K | \u9752\u6625\u5c0fM\u4e0d\u4f1a\u68a6\u5230\u517d\u8033\u5a18 | 1m 9s | ✓ |
CF 105575E - 安排时间
We are given a schedule planning problem. There are several people, and each person provides one or more time intervals during which they are available. The goal is to determine a single moment in time when the maximum number of people are simultaneously available.
CF 105575I - 心意无向，前程有向
We are given a graph structure with directed constraints and undirected relationships over the same set of vertices.
CF 105575J - 我喜欢回文串
We are given a string that may contain lowercase letters and wildcard characters. Each wildcard can be replaced by any lowercase letter.
CF 105575A - 统计选手
The task describes a very small computation: four integers are provided as input, and the program must output their total sum. There is no additional structure, no hidden transformation, and no dependency between the numbers beyond simple addition.
CF 105575D - Permutation with MAX Score
We are given multiple independent queries, each query consists of a single integer $n$. For each $n$, we need to compute a value that depends on how far we can repeatedly apply a specific growth process starting from a fixed base expression derived from small integers.
CF 105575K - 青春小M不会梦到兽耳娘
We are given several two-dimensional integer vectors. Each vector represents a step you are allowed to use, and you are allowed to take integer linear combinations of these vectors, meaning you can add or subtract them any number of times and scale them by integers.
CF 105575G - The Greatest War
We are given three collections of integers. You can think of them as three types of resources that must be matched over time: one set represents units that “live” through damage, and the other two sets represent equipment that either protects them or increases their…
CF 105575B - A Typical Codeforces Round
Each problem instance consists of three arrays of length $n$, which we can think of as per-problem parameters. For each index $i$, there are fixed values $ai$, $bi$, and $ci$.
CF 105575H - YiYi Loves Beautiful Number String
We are working with a string made of decimal digits. The string changes over time through point updates, where a single position is modified, and after each modification we must decide whether the current string can be partitioned into some number of contiguous groups that…
CF 105575F - 全能猫娘的烦恼
We are given a collection of tasks. Each task has a processing time and a deadline-like constraint that represents the latest moment by which it must be completed.
CF 105575C - 猫娘魔法
We are given a single string that encodes a sequence of fixed-size tokens. Each meaningful token is exactly 5 characters long, and the string should be viewed as a concatenation of such 5-character blocks.