关闭
当前搜索:

HDU 6096 String

Problem Description Bob has a dictionary with N words in it.  Now there is a list of words in which the middle part of the word has continuous letters disappeared. The middle part does not include t...
阅读(30) 评论(0)

HDU 2222 Keywords Search

Problem Description In the modern time, Search engine came into the life of everybody like Google, Baidu, etc. Wiskey also wants to bring this feature to his image retrieval system.  Every image ha...
阅读(52) 评论(0)

HDU 2203 亲和串

Problem Description 人随着岁数的增长是越大越聪明还是越大越笨,这是一个值得全世界科学家思考的问题,同样的问题Eddy也一直在思考,因为他在很小的时候就知道亲和串如何判断了,但是发现,现在长大了却不知道怎么去判断亲和串了,于是他只好又再一次来请教聪明且乐于助人的你来解决这个问题。  亲和串的定义是这样的:给定两个字符串s1和s2,如果能通过s1循环移位,使s2包含在s1中,那...
阅读(42) 评论(0)

HDU 2087 剪花布条

Problem Description 一块花布条,里面有些图案,另有一块直接可用的小饰条,里面也有一些图案。对于给定的花布条和小饰条,计算一下能从花布条中尽可能剪出几块小饰条来呢? Input 输入中含有一些数据,分别是成对出现的花布条和小饰条,其布条都是用可见ASCII字符表示的,可见的ASCII字符有多少个,布条的花纹也有多少种花样。花纹条和小饰条不会超过1000个字符长。...
阅读(25) 评论(0)

HDU 1711 Number Sequence

Problem Description 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 number K which make a[K] = b[1], a[K...
阅读(44) 评论(0)

HDU 1686 Oulipo

Problem Description The 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...
阅读(47) 评论(0)

HDU 1251 统计难题

Problem Description Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). Input 输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串...
阅读(30) 评论(0)

HDU 1305 Immediate Decodability

Problem Description An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this problem that all ...
阅读(40) 评论(0)

Online Judge判题结果解析

正确(AC: Accept 即表示程序通过) 恭喜你了 答案错误(Wrong Answer) 答案不对,仅仅通过样例数据的测试并不一定是正确答案。如果你的程序有错误自然只能改正后再交。 但是初学者还有一个常见的错误是计算结果已经正确了,但是输出格式不按样例来导致错误。 本学校OJ上一个结果如下:  263281 1505020241 C ...
阅读(242) 评论(0)

HDU 1719 Friend

Problem Description Friend number are defined recursively as follows.  (1) numbers 1 and 2 are friend number;  (2) if a and b are friend numbers, so is ab+a+b;  (3) only the numbers defined in (1)...
阅读(51) 评论(0)

HDU 3763 CD(二分查找)

Problem Description Jack and Jill have decided to sell some of their Compact Discs, while they still have some value. They have decided to sell one of each of the CD titles that they both own. How ma...
阅读(78) 评论(0)

HDU 1727 Hastiness

Problem Description How many problems did you AC?  When you read this problem, don’t hasty and careless, this is also simple, haha, I didn’t cheat you.  The game over soon, WisKey starts using Engl...
阅读(42) 评论(0)

HDU 1114 Piggy-Bank

Problem Description Before 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 ...
阅读(38) 评论(0)

HDU 4501 小明系列故事——买年货(二维背包变形)

Problem Description   春节将至,小明要去超市购置年货,于是小明去了自己经常去的都尚超市。    刚到超市,小明就发现超市门口聚集一堆人。用白云女士的话说就是:“那家伙,那场面,真是人山人海,锣鼓喧天,鞭炮齐呤,红旗招展。那可真是相当的壮观啊!”。好奇的小明走过去,奋力挤过人群,发现超市门口贴了一张通知,内容如下:        值此新春佳节来临之际,为了回馈广大顾客的...
阅读(87) 评论(0)

HDU 2191 悼念512汶川大地震遇难同胞——珍惜现在,感恩生活

Problem Description 急!灾区的食物依然短缺!  为了挽救灾区同胞的生命,心系灾区同胞的你准备自己采购一些粮食支援灾区,现在假设你一共有资金n元,而市场有m种大米,每种大米都是袋装产品,其价格不等,并且只能整袋购买。  请问:你用有限的资金最多能采购多少公斤粮食呢? 后记:  人生是一个充满了变数的生命过程,天灾、人祸、病痛是我们生命历程中不可预知的威胁。  月有阴晴...
阅读(36) 评论(0)
148条 共10页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:15448次
    • 积分:1446
    • 等级:
    • 排名:千里之外
    • 原创:124篇
    • 转载:24篇
    • 译文:0篇
    • 评论:0条