摘要: 题目名称:Friends题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5305题意:给定n个人,m对朋友关系,朋友关系可以选择online聊天,也可以选择offline,对于每个人,他选择的online和offline的朋友相同(比如拥有x个onlin... 阅读全文
posted @ 2015-07-23 21:11 maplefighting 阅读(134) 评论(0) 推荐(0) 编辑
摘要: 题目名称:Oil Deposits题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1241Problem DescriptionThe GeoSurvComp geologic survey company is responsible for dete... 阅读全文
posted @ 2015-07-22 16:46 maplefighting 阅读(127) 评论(0) 推荐(0) 编辑
摘要: 题目名称:Pots题目链接:http://poj.org/problem?id=3414题意:给出了两个瓶子的容量A,B, 以及一个目标水量C,对A、B可以有如下操作:FILL(i) 将瓶 i 倒满水;DROP(i) 将瓶 i 倒空;POUR(i,j) 将瓶 i 的水倒到瓶... 阅读全文
posted @ 2015-07-22 16:37 maplefighting 阅读(151) 评论(0) 推荐(0) 编辑
摘要: 题目名称:Shuffle'm Up题目链接:http://poj.org/problem?id=3087题意:有两堆扑克 S1 ,S2,牌数均为C,将它们 一张S1一张S2 交叉合成一堆S12(如原图),然后把S12分为上下两堆,各为C,把下面那堆给S12,上面给S2现在输入S1和S2的初始状态 以... 阅读全文
posted @ 2015-07-22 16:09 maplefighting 阅读(163) 评论(0) 推荐(0) 编辑
摘要: 题目名称:Prime Path 题目链接:http://poj.org/problem?id=3126 Description The ministers of the cabinet were quite upset by the message from the Chief of Securit 阅读全文
posted @ 2015-07-22 15:17 maplefighting 阅读(105) 评论(0) 推荐(0) 编辑
摘要: 题目名称:OO’s Sequence 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5288 Problem Description OO has got a array A of size n ,defined a function f(l,r) r 阅读全文
posted @ 2015-07-22 14:39 maplefighting 阅读(130) 评论(0) 推荐(0) 编辑
摘要: 题目名称:Find The Multiple 题目链接:http://poj.org/problem?id=1426 Description Given a positive integer n, write a program to find out a nonzero multiple m of 阅读全文
posted @ 2015-07-17 21:39 maplefighting 阅读(130) 评论(0) 推荐(0) 编辑
摘要: 题目名称:Fliptile 题目链接:http://poj.org/problem?id=3279 Description Farmer John knows that an intellectually satisfied cow is a happy cow who will give more 阅读全文
posted @ 2015-07-17 20:55 maplefighting 阅读(141) 评论(0) 推荐(0) 编辑
摘要: 题目名称:Catch That Cow 题目链接:http://poj.org/problem?id=3278 Description Farmer John has been informed of the location of a fugitive cow and wants to catch 阅读全文
posted @ 2015-07-17 20:33 maplefighting 阅读(137) 评论(0) 推荐(0) 编辑
摘要: 题目名称:迷宫问题 题目链接:http://poj.org/problem?id=3984 Description 定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 阅读全文
posted @ 2015-07-16 20:17 maplefighting 阅读(118) 评论(0) 推荐(0) 编辑