摘要： 描述 现在呢有两个整形数组，a[n]和b[m]，而且已经知道这两个数组都是非降序数组。现在呢就有一个工作需要你来完成啦。对于a中的每个元素a[i]在b中寻找<=a[i] 的元素个数，个数记为x[i]。但是我们并不关心每个x[i],现在只要你计算所有x[i]的和就可以啦。 输入 输入包含单组样例第一行 阅读全文

摘要： The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies 阅读全文

摘要： Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concate 阅读全文

摘要： There is a string A. The length of A is less than 1,000,000. I rewrite it again and again. Then I got a new string: AAAAAA...... Now I cut it from two 阅读全文

摘要： Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a 阅读全文

摘要： Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 28719 Accepted Submission(s): 9792 Problem Des 阅读全文

摘要： The "travelling salesman problem" asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shor 阅读全文

摘要： Description World-renowned Prof. A. N. Agram's current research deals with large anagram groups. He has just found a new application for his theory on 阅读全文

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19109 Accepted Submission(s): 6748 Problem Descri 阅读全文

摘要： Description A word is a string of lowercases. A word pattern is a string of lowercases, '?'s and '*'s. In a pattern, a '?' matches any single lowercas 阅读全文