2023 Xiangtan Unversity Freshman Conteset

10 problems from 2023 Xiangtan Unversity Freshman Conteset (contest 104303), difficulty -. 9/10 solutions verified against sample I/O.

10 items

2023 Xiangtan Unversity Freshman Conteset

Special | 10 problems | 9/10 verified | Difficulty - | 10m 51s

#	Problem	Time	✓
A	\u7b7e\u5230\u5566~	49s	✓
B	\u7199\u5de8\u6253\u7968	51s	✓
C	\u4e09\u5143\u5206\u914d	57s	✓
D	[](https://codeforces.com/problemset/problem/104303/D)	48s	✓
E	\u8bfb\u4e2d\u56fd\u6570\u5b57	2m 15s
F	\u60a8\u6709\u4e00\u5c01\u65b0\u90ae\u4ef6\u5f85\u63a5\u6536	57s	✓
G	\u7a7a\u6c14\u6251\u514b	1m 45s	✓
H	\u6211\u7231XTU	52s	✓
I	\u5c0f\u9ed1\u7684\u9e21\u811aplus	47s	✓
J	\u7ec4\u961f	50s	✓

Practice › Codeforces Solutions › 2023 Xiangtan Unversity Freshman Conteset ›

CF 104303J - 组队

We are given a pool of students, each student knows a subset of up to 60 topics. A valid team is any subset of students such that two conditions are simultaneously satisfied: every topic from 1 to p is covered by at least one team member, and for each topic, at most one team…

Practice › Codeforces Solutions › 2023 Xiangtan Unversity Freshman Conteset ›

CF 104303I - 小黑的鸡脚plus

We are given a binary string, where each position is either 0 or 1. We are allowed to change at most k zeros into ones.

Practice › Codeforces Solutions › 2023 Xiangtan Unversity Freshman Conteset ›

CF 104303E - 读中国数字

Let $x in [0,1)$ have ternary expansion $x = 0.x1 x2 x3 cdots quad (xj in {0,1,2}),$ where nonterminating representations are used. Define $omega = e^{2pi i/3}$, so $omega^3 = 1$ and $1 + omega + omega^2 = 0$.

Practice › Codeforces Solutions › 2023 Xiangtan Unversity Freshman Conteset ›

CF 104303H - 我爱XTU

We are given a string made only of the characters X, T, and U. For each test case, we need to count how many substrings have the property that the number of X, T, and U characters inside that substring are all equal.

Practice › Codeforces Solutions › 2023 Xiangtan Unversity Freshman Conteset ›

CF 104303G - 空气扑克

We are given a two-versus-two game where each round reduces to a comparison between two independent “targets” produced by the two main players, Mo and Larro. In each round, Mo and Larro each pick one number from their personal hand. These numbers become target sums.

Practice › Codeforces Solutions › 2023 Xiangtan Unversity Freshman Conteset ›

CF 104303F - 您有一封新邮件待接收

We are given a directed network of people where each person knows the addresses of some other people. When someone receives a message, they immediately forward it to everyone they know. The process starts from a specific person and repeats indefinitely.

Practice › Codeforces Solutions › 2023 Xiangtan Unversity Freshman Conteset ›

CF 104303D - "逆"天求和

For each query, we are given a prime number $p$. We look at all integers from $1$ to $p-1$, and for each such integer $a$, we compute its multiplicative inverse modulo $p$. That means we find a number $b$ in the range $[1, p-1]$ such that $a cdot b equiv 1 pmod p$.

Practice › Codeforces Solutions › 2023 Xiangtan Unversity Freshman Conteset ›

CF 104303B - 熙巨打票

We are given a ticket-printing system with two identical machines that can be used to generate reimbursement slips. Each machine can produce at most one ticket per operation, and after producing a ticket it becomes unavailable for a cooling period of a minutes.

Practice › Codeforces Solutions › 2023 Xiangtan Unversity Freshman Conteset ›

CF 104303C - 三元分配

We are given three groups of employees with sizes A, B, and C. Every employee must be placed into pairs, meaning each employee is matched with exactly one other employee, and no one is left unmatched.

Practice › Codeforces Solutions › 2023 Xiangtan Unversity Freshman Conteset ›

CF 104303A - 签到啦~

We are given multiple independent scenarios. In each scenario, a student starts with a fixed number of items that must be carried, and there are several checkpoints along a path.