- 博客(7)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 HDU - Segment Tree with Pruning
题目链接：https://acm.hdu.edu.cn/showproblem.php?pid=6983 Problem Description Chenjb is struggling with data stucture now. He is trying to solve a problem using segment tree. Chenjb is a freshman in programming contest, and he wrote down the following C/C++ cod
2021-08-08 09:06:14
254
1
原创 HDU - I love exam
题目链接：https://acm.hdu.edu.cn/showproblem.php?pid=6968 Problem Description Student Z doesn’t love exams The exam was about to be done soon, but student Z didn’t even read the book, He had collapsed. Student Z has a total of n exams, and there are still t day
2021-08-07 18:12:45
240
原创 HDUOJ -I love string
题目链接：https://acm.hdu.edu.cn/showproblem.php?pid=6965 Problem Description Mr X likes to play string games. Mr X has an operation sequence. This operation sequence can be written as a string. For each operation, the next character of the operation sequence c
2021-07-28 19:23:54
192
原创 HDUOJ -I love cube
题目链接：https://acm.hdu.edu.cn/showproblem.php?pid=6961 Problem Description Give you a cube with a side length of n-1. Find the number of equilateral triangles with three points on the cube point. Each side must be parallel to a certain surface of Oxy, Oxz, O
2021-07-28 18:55:29
236
原创 HDUOJ - KD-Graph
题目链接：https://acm.hdu.edu.cn/showproblem.php?pid=6958 Problem Description Let’s call a weighted connected undirected graph of n vertices and m edges KD-Graph, if the following conditions fulfill: n vertices are strictly divided into K groups, each group c
2021-07-24 02:27:26
203
原创 HDUOJ联赛-Minimum spanning tree
题目链接：https://acm.hdu.edu.cn/showproblem.php?pid=6954 Problem Description Given n-1 points, numbered from 2 to n, the edge weight between the two points a and b is lcm(a, b). Please find the minimum spanning tree formed by them. A minimum spanning tree is a
2021-07-23 19:21:09
188
原创 牛客多校1 A. Alice and Bob
题目链接：https://ac.nowcoder.com/acm/contest/11166/A 题目描述 Alice and Bob like playing games. There are two piles of stones with numbers nnn and mmm. Alice and Bob take turns to operate, each operation can take away k(k>0)k(k>0)k(k>0) stones from one pi
2021-07-23 17:11:56
439
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人