![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
[kuangbin带你飞]专题一 简单搜索
ForABiggerWorld
这个作者很懒,什么都没留下…
展开
-
poj3278--Catch That Cow(BFS+裁剪记录)
Catch That Cow Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 48020 Accepted: 15054 Description Farmer John has been informed of the location of原创 2017-12-20 17:33:51 · 182 阅读 · 0 评论 -
POJ 1321 棋盘问题(DFS)
棋盘问题 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 29621 Accepted: 14687 Description 在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,原创 2017-12-17 16:43:22 · 249 阅读 · 0 评论 -
POJ 2251 Dungeon Master(3维BFS)
Dungeon Master Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13187 Accepted: 5113 Description You are trapped in a 3D dungeon and need to原创 2017-12-18 21:27:41 · 249 阅读 · 0 评论 -
D-FlipTile
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; 1 ≤ N ≤ 15...原创 2018-10-04 09:05:15 · 126 阅读 · 0 评论 -
E - Find The Multiple
Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there...原创 2018-10-04 11:13:04 · 110 阅读 · 0 评论 -
F - Prime Path
题目大意:给一个四位数,最小次数变成另外一个四位数,每次变一位,并且中间都只能是prime 思路:筛法求prime,然后BFS #include <cstdio> #include <cstdlib> #include <string.h> #include <string> #include <math.h> #includ...原创 2018-10-04 11:14:57 · 110 阅读 · 0 评论 -
G - Shuffle'm Up
A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C chips. Ea...原创 2018-10-04 16:32:15 · 147 阅读 · 0 评论 -
H - Pots
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) empty the po...原创 2018-10-04 16:33:06 · 225 阅读 · 0 评论