摘要：
Killer Names Problem Description > Galen Marek, codenamed Starkiller, was a male Human apprentice of the Sith Lord Darth Vader. A powerful Force-user 阅读全文
摘要：
Typesetting Problem Description Yellowstar is writing an article that contains N words and 1 picture, and the i-th word contains ai characters.The pag 阅读全文
摘要：
String Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Problem DescriptionBob has a dictionary with N words in it.N 阅读全文
摘要：
Rikka with String Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to p 阅读全文
摘要：
Matching In Multiplication Problem DescriptionIn the mathematical discipline of graph theory, a bipartite graph is a graph whose vertices can be divid 阅读全文
摘要：
题目链接：点这里 题解： 需要证明，所求的路径一定是全部权值都为1或者，路径上权值至多有一个为2其余为1且权值2在路径中央。 然后树形DP 设定dp[i][0/1] 以1为根的情况下，以i 节点下子树走分别全1和 走一次2和剩余全走1 的最长链 每遍历一次子树，统计一次答案 下面给出代码 #incl 阅读全文
摘要：
3992: [SDOI2015]序列统计 Description 小C有一个集合S，里面的元素都是小于M的非负整数。他用程序编写了一个数列生成器，可以生成一个长度为N的数列，数列中的每个数都属于集合S。 小C用这个生成器生成了许多这样的数列。但是小C有一个问题需要你的帮助：给定整数x，求所有可以生成 阅读全文
摘要：
Classic Quotation Problem Description When online chatting, we can save what somebody said to form his ''Classic Quotation''. Little Q does this, too. 阅读全文
摘要：
Limited Permutation Problem Description As to a permutation p1,p2,⋯,pn from 1 to n, it is uncomplicated for each 1≤i≤n to calculate (li,ri) meeting th 阅读全文
摘要：
Hints of sd0061 Problem Description sd0061, the legend of Beihang University ACM-ICPC Team, retired last year leaving a group of noobs. Noobs have no 阅读全文