摘要：
B -Power StringsTime Limit:3000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionGiven 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 concatenation as m 阅读全文
摘要：
A -OulipoTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter'e'. He was a member of the Oulipo group. A quote from the book:Tout avait Pair normal, mais 阅读全文
摘要：
PieTime Limit:1000MSMemory Limit:65536KTotal Submissions:8594Accepted:3124Special JudgeDescriptionMy birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and each o 阅读全文
摘要：
正好训练赛来了一道最长递减序列问题，所以好好研究了一下最长递增序列问题。B -Testing the CATCHERTime Limit:1000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 1887DescriptionA military contractor for the Department of Defense has just completed a series of preliminary tests for a new defensive missile call 阅读全文
摘要：
F -DividingTime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the sa 阅读全文
摘要：
B -Piggy-BankTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea behind is 阅读全文
摘要：
A -饭卡Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescription电子科大本部食堂的饭卡有一种很诡异的设计，即在购买之前判断余额。如果购买一个商品之前，卡上的剩余金额大于或等于5元，就一定可以购买成功（即使购买后卡上余额为负），否则无法购买（即使金额足够）。所以大家都希望尽量使卡上的余额最少。某天，食堂中有n种菜出售，每种菜可购买一次。已知每种菜的价格以及卡上的余额，问最少可使卡上的余额为多少。Input多组数据。对于每组数据：第一行为正整数n，表示菜的数量。n#i 阅读全文
摘要：
The SuspectsTime Limit:1000MSMemory Limit:20000KB64bit IO Format:%I64d & %I64u[Submit] [Go Back] [Status]DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the b 阅读全文
摘要：
Monkey and BananaTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%lld & %lluSubmitStatusDescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the... 阅读全文
摘要：
Time Limit:10000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionIgnatius花了一个星期的时间终于找到了传说中的宝藏,宝藏被放在一个房间里,房间的门用密码锁起来了,在门旁边的墙上有一些关于密码的提示信息:密码是一个C进制的数,并且只能由给定的M个数字构成,同时密码是一个给定十进制整数N(0#include #include #include #include #include #include using namespace std;int n,m,k;int re[ 阅读全文