摘要：
C. An impassioned circulation of affection time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outp 阅读全文
摘要：
2800 送外卖 时间限制: 2 s 空间限制: 256000 KB 题目等级 : 钻石 Diamond <!-- clearfix --> <!-- col-sm-8 --> 题解 查看运行结果 回到问题 2800 送外卖 2800 送外卖 时间限制: 2 s 空间限制: 256000 KB 题目 阅读全文
摘要：
D. Two Melodies time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D. Two Melodies time lim 阅读全文
摘要：
E. Army Creation time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output E. Army Creation time l 阅读全文
摘要：
Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一 阅读全文
摘要：
You have written on a piece of paper an array of n positive integers a[1], a[2], ..., a[n] and m good pairs of integers (i1, j1), (i2, j2), ..., (im, 阅读全文
摘要：
The determinant is quite important in Linear Algebras, but I think that almost everyone who has ever learnt Linear Algebras is tired of the complicate 阅读全文
摘要：
Archaeologists find ruins of Ancient ACM Civilization, and they want to rebuild it. The ruins form a closed path on an x-y plane, which has nn endpoin 阅读全文
摘要：
借用 链接 的题意和解法分析的图片。 对于这种环的形式，先用常用的手段复制一份在右边。每次加点的过程只要看加完之后能不能通过已有的格子联通，如果联通则显然已经形成了一个环。这里判断联通我采用的办法是，分别看两个点八个方向是否联通的无脑办法。想法很明确，但实现的过程中要注意一些细节，如列坐标<=0或> 阅读全文
摘要：
You have multiset of n strings of the same length, consisting of lowercase English letters. We will say that those strings are easy to remember if for 阅读全文