摘要：
Election TimeTime Limit: 1000MS Memory limit: 65536K题目描述The cows are having their first election after overthrowing the tyrannical Farmer John, and Bessie is one of N cows (1 ≤ N ≤ 50,000) running for President. Before the election actually happens, however, Bessie wants to determine who has the bes 阅读全文
摘要：
Time Limit: 3000MS Memory limit: 65536K 题目描述In St Petersburg phone numbers are formatted as “XXX–XX–XX”, where the first three digits represent index of the Automated Telephone Exchange (ATE). Each ATE has exactly 10000 unique phone numbers.Peter has just bought a new flat and now he wants to install 阅读全文
摘要：
Time Limit: 1000MS Memory limit: 65536K 题目描述You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.输入Input consists of up to 100,000 dictionary entries, followed by a bla 阅读全文
摘要：
题目描述 “回文串”是一个正读和反读都一样的字符串，比如“level”或者“noon”等等就是回文串。现在呢，就是让你判断输入的字符串是否是回文串。输入 有多组输入，每行输入一串字符，保证字符串长度不会大于 100000，字符串由大小写英文字母和空格组成，以字符串“2013”作为结束标志。输出 每行输出一个字符串，如果输入是回文串，输出“YES”，否则输出“NO”（注意：判断的时候空格是不作判断的,详见样例）。示例输入aaaaggg glozxvxoMJBCHsTXooXTsHCBJMoxvxzoli am a good acmer2013示例输出YESYESYESNO感觉这题水水的 不解释 阅读全文
摘要：
I-numberTime Limit: 5000MS Memory limit: 65536K题目描述题目描述The I-number of x is defined to be an integer y, which satisfied the the conditions below:1. y>x;2. the sum of each digit of y(under base 10) is the multiple of 10;3. among all integers that satisfy the two conditions above, y shouble be the 阅读全文