zhber
有好多做过的题没写下来,如果我还能记得就补吧
摘要: DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whe... 阅读全文
posted @ 2014-12-14 20:22 zhber 阅读(119) 评论(0) 推荐(0) 编辑
摘要: DescriptionGiven 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... 阅读全文
posted @ 2014-12-14 20:07 zhber 阅读(153) 评论(0) 推荐(0) 编辑
摘要: DescriptionThe 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-... 阅读全文
posted @ 2014-12-14 19:48 zhber 阅读(135) 评论(0) 推荐(0) 编辑
摘要: Description给你一个字符串,它是由某个字符串不断自我连接形成的。 但是这个字符串是不确定的,现在只想知道它的最短长度是多少.Input第一行给出字符串的长度,1 #include#include#include#include#include#include#include#include... 阅读全文
posted @ 2014-12-14 18:56 zhber 阅读(217) 评论(0) 推荐(0) 编辑
摘要: DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter'e'. He was a member of the Oulipo group. ... 阅读全文
posted @ 2014-12-14 18:49 zhber 阅读(127) 评论(0) 推荐(0) 编辑
摘要: Description现在我们的手头有N个软件,对于一个软件i,它要占用Wi的磁盘空间,它的价值为Vi。我们希望从中选择一些软件安装到一台磁盘容量为M计算机上,使得这些软件的价值尽可能大(即Vi的和最大)。但是现在有个问题:软件之间存在依赖关系,即软件i只有在安装了软件j(包括软件j的直接或间接依赖... 阅读全文
posted @ 2014-12-14 12:46 zhber 阅读(178) 评论(0) 推荐(0) 编辑
摘要: Description现在我们的手头有N个软件,对于一个软件i,它要占用Wi的磁盘空间,它的价值为Vi。我们希望从中选择一些软件安装到一台磁盘容量为M计算机上,使得这些软件的价值尽可能大(即Vi的和最大)。但是现在有个问题:软件之间存在依赖关系,即软件i只有在安装了软件j(包括软件j的直接或间接依赖... 阅读全文
posted @ 2014-12-14 12:46 zhber 阅读(143) 评论(0) 推荐(0) 编辑
摘要: A. Treasuretime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMalek has recently found a treasure m... 阅读全文
posted @ 2014-12-14 11:13 zhber 阅读(260) 评论(0) 推荐(0) 编辑