摘要：
题目描述 Once in a forest, there lived N aggressive monkeys. At the beginning, they each does things in its own way and none of them knows each other. But 阅读全文
摘要：
Mondriaan's Dream Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 18359 Accepted: 10487 Description Squares and rectangles fascinated the f 阅读全文
摘要：
A multiplication game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6421 Accepted: 3225 Description Stan and Ollie play the game of multi 阅读全文
摘要：
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3525 Accepted Submission(s): 1212 Problem Descri 阅读全文
摘要：
感谢gryz的mly大好人再次给我提供了题目和数据。 和昨晚那个题几乎一样，都是x^n最后转化成第二类斯特林数*阶乘*Σ(和路径长度有关的组合数)，而因为组合数是可以利用Pascal公式实现O(1)递推的，所以最后的复杂度都降为O(NK)。 随便推一下， ANS(x)=Σ(p是1到x的一条路径) l 阅读全文