CCF CAT NAEC 2025 (Provincial)

10 problems from CCF CAT NAEC 2025 (Provincial) (contest 105948), difficulty -. 10/10 solutions verified against sample I/O.

10 items

CCF CAT NAEC 2025 (Provincial)

Special | 10 problems | 10/10 verified | Difficulty - | 10m 4s

#	Problem	Time	✓
A	Executable Log	51s	✓
B	\u5c0f F \u7684\u5206\u6570	57s	✓
C	\u9a6c\u62c9\u8f66	1m 3s	✓
D	\u7b80\u5355\u6811\u4e0a\u95ee\u9898	1m 4s	✓
E	Colonization Assessment for Terraforming	55s	✓
F	\u8ff7\u5bab (I)	1m 10s	✓
G	\u8ff7\u5bab (II)	1m 4s	✓
H	\u5b50\u5e8f\u5217\u3001\u8fbe\u6807\u7387\u4e0e\u671f\u671b	1m 3s	✓
I	\u7b80\u5355\u7684\u6570\u5b57\u8fd0\u7b97 (II)	1m 1s	✓
J	Ever Forever (II)	56s	✓

Practice › Codeforces Solutions › CCF CAT NAEC 2025 (Provincial) ›

CF 105948J - Ever Forever (II)

We are given a mutable string over lowercase letters. The core quantity we track is defined over a fixed ordered pair of characters, specifically pairs where the first character is 'e' and the second is 'f'.

Practice › Codeforces Solutions › CCF CAT NAEC 2025 (Provincial) ›

CF 105948I - 简单的数字运算 (II)

We are given a function defined on positive integers through their prime factorization. For a number $x$, we decompose it into prime powers $x = prod pi^{alphai}$.

Practice › Codeforces Solutions › CCF CAT NAEC 2025 (Provincial) ›

CF 105948G - 迷宫 (II)

We are given a square grid whose side length is $2n$. Inside this grid, there is a fixed procedure described in a previous part of the problem (迷宫 I) that allows us to add edges between cells according to certain local rules.

Practice › Codeforces Solutions › CCF CAT NAEC 2025 (Provincial) ›

CF 105948H - 子序列、达标率与期望

We are given an array of positive integers of length up to 50. For every subset size $k$ from 2 up to $n$, we look at all subsequences of that size, chosen uniformly at random.

Practice › Codeforces Solutions › CCF CAT NAEC 2025 (Provincial) ›

CF 105948E - Colonization Assessment for Terraforming

We are given a graph where each vertex represents a planet and each vertex has a numeric value called its habitability. The graph is undirected, and edges represent bidirectional travel routes between planets.

Practice › Codeforces Solutions › CCF CAT NAEC 2025 (Provincial) ›

CF 105948D - 简单树上问题

We are given a rooted tree with root fixed at node 1. Each node carries a non-negative integer value. The only operation allowed is to choose a node u and an integer x ≥ 0, then XOR every node in u’s subtree with a value equal to a fixed bit pattern depending on x…

Practice › Codeforces Solutions › CCF CAT NAEC 2025 (Provincial) ›

CF 105948C - 马拉车

We are given two collections: horses with stamina values and carts with weights. Each horse must be assigned exactly one cart, and each cart can be used at most once. If a horse with stamina $Ei$ pulls a cart with weight $Wj$, its movement contribution is $max(Ei - Wj, 0)$.

Practice › Codeforces Solutions › CCF CAT NAEC 2025 (Provincial) ›

CCF CAT NAEC 2025 (Provincial)

CCF CAT NAEC 2025 (Provincial)

CF 105948J - Ever Forever (II)

CF 105948I - 简单的数字运算 (II)

CF 105948G - 迷宫 (II)

CF 105948H - 子序列、达标率与期望

CF 105948E - Colonization Assessment for Terraforming

CF 105948D - 简单树上问题

CF 105948C - 马拉车

CF 105948A - Executable Log

CF 105948F - 迷宫 (I)

CF 105948B - 小 F 的分数