摘要：
Problem DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 #includeint s1[1000005... 阅读全文
摘要：
Problem DescriptionFor the k-th number, we all should be very familiar with it. Of course,to kiki it is also simple. Now Kiki meets a ... 阅读全文
摘要：
As you are probably well aware, in Byteland it is always the military officer's main worry to order his soldiers on parade correctly. ... 阅读全文
摘要：
There are N seaside villages on X island, numbered from 1 to N. N roads are built to connect all of them, which are also numbered from... 阅读全文
摘要：
Problem DescriptionOne day Sophia finds a very big square. There are n trees in the square. They are all so tall. Sophia is very inter... 阅读全文
摘要：
My Tags (Edit) Source : mostleg Time limit : 1 sec Memory limit : 64 MSubmitted : 725, Accepted : 286As most of the ACMers, wy's next... 阅读全文
摘要：
Problem DescriptionLong long ago, there was a gunner whose name is Jack. He likes to go hunting very much. One day he go to the grove.... 阅读全文
摘要：
Problem Description小度熊拿到了一个无序的数组，对于这个数组，小度熊想知道是否能找到一个k 的区间，里面的 k 个数字排完序后是连续的。现在小度熊增加题目难度，他不想知道是否有这样的 k 的区间，而是想知道有几个这样的 k 的区间。 Input输入包... 阅读全文
摘要：
Problem Description百小度是一个ACMer，也是一个超级赛亚人，每个ACMer都有一个战斗力，包括百小度。
所谓超级赛亚人的定义，是说如果在对抗中刚好接近极限状态，那就会激发斗志，实力提升.具体来说，就是百小度现在要接受一些ACMer的挑... 阅读全文
摘要：
There are n cities in Westeros. The i-th city is inhabited by ai people. Daenerys and Stannis play the following game: in one single m... 阅读全文