摘要:
题目链接:https://nanti.jisuanke.com/t/42586 题意:给一棵n个节点的树,编号1-n,每个点有点权w,问有多少组节点(x,y),满足: 1.x != y 2.x点不是y点的祖先,y点不是x点的祖先 3.x点和y点的最短距离<=k (看了题解才知道,up to k 原来 阅读全文
摘要:
题目: Adding two numbers several times is a time-consuming task, so you want to build a robot. The robot should have a string S=S1S2…SNS=S1S2…SN of NN c 阅读全文
摘要:
题目: Randall is a software engineer at a company with NN employees. Every year, the company re-evaluates its employees. At the end of every year, the c 阅读全文
摘要:
题目: As you might already know, space has always been a problem in ICPC Jakarta. To cope with this, ICPC Jakarta is planning to build two new buildings 阅读全文
摘要:
题目: Andi is a mathematician, a computer scientist, and a songwriter. After spending so much time writing songs, he finally writes a catchy melody that 阅读全文