搜索
文章平均质量分 82
muyu__
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ 3216 Prime Path(宽搜+筛素数)
POJ 3216 Description The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. — ...原创 2018-10-12 10:13:10 · 270 阅读 · 0 评论 -
POJ 1321 棋盘问题(深搜)
POJ 1321 棋盘问题 Description 在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。 Input 输入含有多组测试数据。 每组数据的第一行是两个正整数,n k,用一个空格隔开,表示了将在一个n*n的矩阵内描述棋盘,以及摆放棋子的数目...原创 2018-10-06 18:27:23 · 200 阅读 · 0 评论 -
POJ 2251 Dungeon Master(宽搜)
Description You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit ...原创 2018-10-06 22:16:46 · 193 阅读 · 0 评论 -
POJ 3278 Catch That Cow(宽搜)
POJ 3278 Catch That Cow Description Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and th...原创 2018-10-06 22:35:29 · 182 阅读 · 0 评论 -
POJ 3279 Fliptile(枚举+模拟)
Description Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M × N grid (1 ≤ M ≤ 15...原创 2018-10-14 23:15:15 · 266 阅读 · 0 评论 -
UVA-11624 Fire!(宽搜)
UVA-11624 Fire! Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze. Given Joe’s lo...原创 2018-10-22 21:21:27 · 298 阅读 · 0 评论 -
HDU - 2612 Find a way(宽搜)
Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki. Yifenfei’s home is at the cou...原创 2018-10-26 19:59:59 · 162 阅读 · 0 评论 -
POJ 3414 Pots(宽搜)
Description You are given two pots, having the volume of A and B liters respectively. The following operations can be performed: FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap; DROP(i) em...原创 2018-10-24 20:27:23 · 180 阅读 · 0 评论 -
POJ 1797 Heavy Transportation(二分+宽搜)
Description Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the pl...原创 2018-11-03 19:34:08 · 221 阅读 · 0 评论 -
CodeForces - 1118F1 Tree Cutting (Easy Version) (树上dfs)
Tree Cutting (Easy Version) You are given an undirected tree of n vertices. Some vertices are colored blue, some are colored red and some are uncolored. It is guaranteed that the tree contains at leas...原创 2019-03-06 19:14:48 · 334 阅读 · 1 评论
分享