cf
文章平均质量分 94
前 方
这个作者很懒,什么都没留下…
展开
-
A. Copil Copac Draws Trees(Codeforces Round 875 (Div. 1))
Copil Copac is given a list of n−1n-1n−1 edges describing a tree of nnn vertices. He decides to draw it using the following algorithm:The number of readings is defined as the number of times Copil Copac performs step 111.Find the number of readings needed原创 2023-08-16 10:33:27 · 290 阅读 · 0 评论 -
C. Yet Another Permutation Problem(Codeforces Round 893 (Div. 2))
Alex got a new game called “GCD permutations” as a birthday present. Each round of this game proceeds as follows:Alex has already played several rounds so he decided to find a permutation a1,a2,…,ana_1, a_2, \ldots, a_na1,a2,…,an such that its score is原创 2023-08-16 10:17:42 · 250 阅读 · 0 评论