06 2021 档案
摘要:Description 如果一棵树的所有非叶节点都恰好有 个儿子,那么我们称它为严格 元树。如果该树中最底层的节点深度为 (根的深度为 ),那么我们称它为一棵深度为 的严格 元树。例如,深度为2的严格2元树有三个,如下图: 给出 \
阅读全文
摘要:题目传送门:https://codeforces.com/problemset/problem/280/C Description Momiji has got a rooted tree, consisting of nodes. The tree nodes are numbered
阅读全文
摘要:Description Find the biggest integer and an integer to make them satisfy Input The input consists of several tes
阅读全文
摘要:Description Tina Town is a friendly place. People there care about each other. Tina has a ball called zball. Zball is magic. It grows larger every day
阅读全文
摘要:Description iSea is tired of writing the story of Harry Potter, so, lucky you, solving the following problem is enough. Input The first line contains
阅读全文
摘要:Description There is a board, a chess want to go to the position from the position . The chess is able to go to position \(
阅读全文
摘要:Description The so-called best problem solver can easily solve this problem, with his/her childhood sweetheart. It is known that \(y=(5+2\sqrt{6})^{1+
阅读全文
摘要:Description Math is important!! Many students failed in 2+2’s mathematical test, so let's AC this problem to mourn for our lost youth.. Look this samp
阅读全文
摘要:Description Chiaki is interested in an infinite sequence which is defined as follows: \(a_n=\begin{cases} 1 &,n=1,2\\a_{n−a_{n−1}}
阅读全文
摘要:Description There is a complete graph containing vertices, the weight of the -th vertex is . The length of edge between vertex
阅读全文
摘要:Description There is a nonnegative integer sequence of length . HazelFan wants to do a type of transformation called prefix-XOR, wh
阅读全文