2012年8月2日

hdu 1686Oulipo

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1686OulipoTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2553Accepted Submission(s): 986Problem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 阅读全文

posted @ 2012-08-02 20:59 仁者无敌8勇者无惧 阅读(372) 评论(0) 推荐(0) 编辑

hdu 1711Number Sequence

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1711Number SequenceTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5807Accepted Submission(s): 2608Problem DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[ 阅读全文

posted @ 2012-08-02 19:25 仁者无敌8勇者无惧 阅读(148) 评论(0) 推荐(0) 编辑

hdu 2087剪花布条

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=2087剪花布条Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4547Accepted Submission(s): 3061Problem Description一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢？Input输入中含有一些数据，分别是成对出现的花布条和小 阅读全文

posted @ 2012-08-02 11:46 仁者无敌8勇者无惧 阅读(163) 评论(0) 推荐(0) 编辑

导航