广东工业大学新生赛(初赛)

10 problems from 广东工业大学新生赛(初赛) (contest 106210), difficulty -. 3/10 solutions verified against sample I/O.

10 items

广东工业大学新生赛(初赛)

Special | 10 problems | 3/10 verified | Difficulty - | 7m 57s

# Problem Rating Tags Accepted Time ✓
A \u6700\u5927\u5b50\u4e32\u5339\u914d\u5220\u9664\u64cd\u4f5c 1m 28s
B \u6211\u4e0d\u662f AI 33s
C \u9003\u51fa\u751f\u5929 1m 34s ✓
D \u5e08\u51fa\u540c\u95e8 32s
E \u7a33\u5b9a\u533a\u95f4 26s
F \u3010\u6a21\u677f\u3011Pollard-Rho 51s ✓
G \u4e92\u5f02\u6392\u5217---\u6269\u5c55 26s
H \u4e92\u5f02\u6392\u5217---\u751f\u6210 1m 6s ✓
I 2-\u51b2\u7a81\u6570\u5bf9 33s
J \u6536\u85cf\u5b9d\u77f3 28s
Practice › Codeforces Solutions › 广东工业大学新生赛(初赛) ›

CF 106210C - 逃出生天

We are given a rectangular grid that behaves like a time dependent maze. A player starts at the top right corner of the grid and wants to reach the bottom left corner.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 广东工业大学新生赛(初赛) ›

CF 106210H - 互异排列---生成

We are not asked to construct the final permutation after insertion. Instead, for a given n, we must construct a permutation p of 1..
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 广东工业大学新生赛(初赛) ›

CF 106210I - 2-冲突数对

The statement you provided is incomplete, so I can’t reconstruct the actual problem reliably. Right now, only the title “2-冲突数对” is visible, but the core definitions are missing: what constitutes a “conflict pair”, what the input describes, and what must be…
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 广东工业大学新生赛(初赛) ›

CF 106210D - 师出同门

I can’t reliably write a correct editorial for this yet because the actual problem statement for “Codeforces 106210D - 师出同门” is not included in your message (it only shows a placeholder “D”).
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 广东工业大学新生赛(初赛) ›

CF 106210A - 最大子串匹配删除操作

all in the style and formatting you specified.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 广东工业大学新生赛(初赛) ›

CF 106210G - 互异排列---扩展

I can’t produce a correct editorial for this yet because the actual problem statement is missing. Right now I only see the title “106210G - 互异排列---扩展”, but there is no description of what is given, what operations are allowed, or what needs to be computed.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 广东工业大学新生赛(初赛) ›

CF 106210J - 收藏宝石

I can’t write a correct editorial for this yet because the actual problem content is missing. Right now I only see the title “Codeforces 106210J - 收藏宝石” and a placeholder “J”, but no description, input/output format, or constraints.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 广东工业大学新生赛(初赛) ›

CF 106210F - 【模板】Pollard-Rho

The task is to take a list of very large integers and break each one into its prime components. For every input number, the output describes how it decomposes into primes, typically by listing the prime factors with their multiplicities or presenting derived information such…
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 广东工业大学新生赛(初赛) ›

CF 106210E - 稳定区间

The statement you provided is incomplete, so there’s no way to reconstruct the actual problem being solved. Right now we only have the title “稳定区间” (Stable Interval) without the definition of what a stable interval is, what the input array looks like, or what needs…
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 广东工业大学新生赛(初赛) ›

CF 106210B - 我不是 AI

I’m missing the actual problem content for Codeforces 106210B - 我不是 AI. Right now the statement section only contains “B”, so there’s nothing concrete to derive the solution from.
codeforces competitive-programming Jun 19, 2026