06 2021 档案

摘要:题目传送门:https://codeforces.com/problemset/problem/103/D 题目大意: 给你一串长度为n的序列A,每次询问给一组(a,b)\(,求\)\sum\limits_^{\lfloor\frac\rfloor}A_{a+bi} 考虑离线,对所有询问 阅读全文
posted @ 2021-06-30 21:53 Wolfycz 阅读(26) 评论(1) 推荐(0) 编辑
摘要:Description 如果一棵树的所有非叶节点都恰好有 n 个儿子,那么我们称它为严格 n 元树。如果该树中最底层的节点深度为 d(根的深度为 0),那么我们称它为一棵深度为 d 的严格 n 元树。例如,深度为2的严格2元树有三个,如下图: 给出 \ 阅读全文
posted @ 2021-06-26 20:53 Wolfycz 阅读(62) 评论(0) 推荐(0) 编辑
摘要:题目传送门:https://codeforces.com/problemset/problem/280/C Description Momiji has got a rooted tree, consisting of n nodes. The tree nodes are numbered 阅读全文
posted @ 2021-06-26 02:29 Wolfycz 阅读(49) 评论(0) 推荐(0) 编辑
摘要:Description Find the biggest integer n(1nN) and an integer x to make them satisfy Input The input consists of several tes 阅读全文
posted @ 2021-06-25 21:26 Wolfycz 阅读(54) 评论(0) 推荐(0) 编辑
摘要: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 阅读全文
posted @ 2021-06-25 20:16 Wolfycz 阅读(54) 评论(0) 推荐(0) 编辑
摘要: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 阅读全文
posted @ 2021-06-25 19:38 Wolfycz 阅读(40) 评论(0) 推荐(0) 编辑
摘要:Description There is a n×m board, a chess want to go to the position (n,m) from the position (1,1). The chess is able to go to position \( 阅读全文
posted @ 2021-06-25 16:31 Wolfycz 阅读(30) 评论(0) 推荐(0) 编辑
摘要: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+ 阅读全文
posted @ 2021-06-25 16:01 Wolfycz 阅读(33) 评论(0) 推荐(0) 编辑
摘要: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 阅读全文
posted @ 2021-06-25 15:31 Wolfycz 阅读(58) 评论(0) 推荐(0) 编辑
摘要:Description Chiaki is interested in an infinite sequence a1,a2,a3,... which is defined as follows: \(a_n=\begin{cases} 1 &,n=1,2\\a_{n−a_{n−1}} 阅读全文
posted @ 2021-06-25 14:54 Wolfycz 阅读(54) 评论(0) 推荐(0) 编辑
摘要:Description There is a complete graph containing n vertices, the weight of the i-th vertex is wi. The length of edge between vertex i 阅读全文
posted @ 2021-06-25 14:22 Wolfycz 阅读(38) 评论(0) 推荐(0) 编辑
摘要:Description There is a nonnegative integer sequence a1...n of length n. HazelFan wants to do a type of transformation called prefix-XOR, wh 阅读全文
posted @ 2021-06-25 12:09 Wolfycz 阅读(51) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示