搜索
听自己心跳的声音
一生大自在,万事将无同。
展开
-
南阳32 组合数——练习回溯深搜
#include#include#include#define maxn 200 //数组要开足够大 int mark[maxn];int k,store[maxn],r,n;void STL(int r){ int i; if(r==0) { int ok=1;原创 2014-04-25 14:27:06 · 859 阅读 · 0 评论 -
杭电1518 Square(DFS+剪枝)
SquareTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8940 Accepted Submission(s): 2908Problem DescriptionGiven a set of sticks原创 2014-11-09 18:41:43 · 759 阅读 · 0 评论 -
杭电2553 N皇后问题(普通方法和位运算两种方法)
N皇后问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8035 Accepted Submission(s): 3586Problem Description在N*N的方格棋盘放置了N个皇后,使得它们不相互原创 2014-06-29 11:50:37 · 1179 阅读 · 0 评论 -
NYOJ82 迷宫寻宝(BFS)
迷宫寻宝(一)时间限制:1000 ms | 内存限制:65535 KB难度:4描述一个叫ACM的寻宝者找到了一个藏宝图,它根据藏宝图找到了一个迷宫,这是一个很特别的迷宫,迷宫里有N个编过号的门(N 输入输入可能会有多组测试数据(不超过10组)。每组测试数据的第一行包含了两个整数M,N(1.表示可以走的路S:表示ACM的出发原创 2014-10-27 17:38:44 · 683 阅读 · 0 评论 -
poj3050 Hopscotch(dfs基础)
HopscotchTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2119 Accepted: 1517DescriptionThe cows play the child's game of hopscotch in a non-traditional原创 2014-11-16 12:06:35 · 635 阅读 · 0 评论 -
杭电1067 Gap(BFS+map)
GapTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 603 Accepted Submission(s): 330Problem DescriptionLet's play a card game cal原创 2014-11-04 18:30:42 · 940 阅读 · 1 评论 -
NYOJ483 Nightmare(BFS)
Nightmare时间限制:1000 ms | 内存限制:65535 KB难度:4描述Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should原创 2014-11-27 22:56:06 · 522 阅读 · 0 评论 -
杭电1010 Tempter of the Bone(奇偶性剪枝)
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 71376 Accepted Submission(s): 19665Problem DescriptionThe dogg原创 2014-08-25 18:09:45 · 670 阅读 · 0 评论 -
杭电2209 翻纸牌游戏(BFS)
翻纸牌游戏Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2449 Accepted Submission(s): 886Problem Description有一种纸牌游戏,很有意思,给你N张纸牌,一字排开,原创 2014-12-08 21:22:00 · 714 阅读 · 0 评论 -
poj3278 Catch That Cow(BFS)
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 49456 Accepted: 15497DescriptionFarmer John has been informed of the location of a fugitiv原创 2014-12-29 14:02:56 · 513 阅读 · 0 评论 -
杭电2612 Find a way(BFS)
Find a wayTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4019 Accepted Submission(s): 1343Problem DescriptionPass a year learnin原创 2014-12-29 18:22:43 · 771 阅读 · 0 评论 -
杭电2181 哈密顿绕行世界问题(DFS)
哈密顿绕行世界问题Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1296 Accepted Submission(s): 810Problem Description一个规则的实心十二面体,它的 20个顶点标原创 2015-01-16 18:21:38 · 667 阅读 · 0 评论 -
poj1321 棋盘问题(DFS)
棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23744 Accepted: 11749Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求原创 2014-12-28 21:33:41 · 520 阅读 · 0 评论 -
poj2251 Dungeon Master(BFS)
Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17256 Accepted: 6721DescriptionYou are trapped in a 3D dungeon and need to find the quicke原创 2014-12-29 07:22:51 · 511 阅读 · 0 评论 -
杭电1796 Safecracker(DFS)
SafecrackerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9011 Accepted Submission(s): 4558Problem Description=== Op tech briefi原创 2014-12-15 07:39:52 · 998 阅读 · 0 评论 -
poj3414 Pots(BFS)
PotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10237 Accepted: 4323 Special JudgeDescriptionYou are given two pots, having the volume of A and原创 2015-01-01 19:42:59 · 630 阅读 · 0 评论 -
FZOJProblem 2150 Fire Game(BFS)
Problem 2150 Fire GameAccept: 513 Submit: 1996Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionFat brother and Maze are playing a kind of special (hentai) game原创 2015-01-01 17:35:36 · 580 阅读 · 0 评论 -
NYOJ43 24 Point game(DFS)
24 Point game时间限制:3000 ms | 内存限制:65535 KB难度:5描述There is a game which is called 24 Point game.In this game , you will be given some numbers. Your task is to find an expressi原创 2014-09-16 15:54:12 · 798 阅读 · 0 评论 -
南阳366 D的小L(DFS和STL)
01. 02.#include03.#include04.#include05.usingnamespace std; 06.intmain() 07.{08. intN; 09. intx; 10. string m;11. cin>>N;12. while(N--)13原创 2014-04-24 08:19:00 · 970 阅读 · 2 评论 -
杭电1312 Red and Black(搜索入门)
Red and BlackTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9744 Accepted Submission(s): 6066Problem DescriptionThere is a recta原创 2014-08-13 19:47:49 · 649 阅读 · 0 评论 -
南阳58 最少步数
最少步数时间限制:3000 ms | 内存限制:65535 KB难度:4描述这有一个迷宫,有0~8行和0~8列: 1,1,1,1,1,1,1,1,1 1,0,0,1,0,0,1,0,1 1,0,0,1,1,0,0,0,1 1,0,1,0,1,1,0,1,1 1,0,0,0,0,1,0,0,1 1,1,0,1,0,1,0,0,1原创 2014-06-15 16:42:47 · 1318 阅读 · 2 评论 -
南阳353 3Ddungeon
3D dungeon时间限制:1000 ms | 内存限制:65535 KB难度:2描述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 fil原创 2014-06-25 00:00:57 · 934 阅读 · 0 评论 -
南阳(NYOJ)284 坦克大战
坦克大战时间限制:1000 ms | 内存限制:65535 KB难度:3描述Many of us had played the game "Battle city" in our childhood, and some people (like me) even often play it on computer now. What we are dis原创 2014-06-16 13:23:25 · 906 阅读 · 0 评论 -
南阳 10 skiing
skiing时间限制:3000 ms | 内存限制:65535 KB难度:5描述Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3原创 2014-06-18 18:09:48 · 793 阅读 · 0 评论 -
南阳 1058 部分和问题
部分和问题时间限制:1000 ms | 内存限制:65535 KB难度:2描述给定整数a1、a2、.......an,判断是否可以从中选出若干数,使它们的和恰好为K。输入首先,n和k,n表示数的个数,k表示数的和。接着一行n个数。(1输出如果和恰好可以为k,输出“YES”,并按输入顺序依次输出是由哪几个数的和组成,否则“NO”样例输入原创 2014-06-15 00:42:09 · 787 阅读 · 0 评论 -
杭电 1728 逃离迷宫(BFS)
逃离迷宫Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13934 Accepted Submission(s): 3325Problem Description 给定一个m × n (m行, n列)的迷宫,原创 2014-06-14 22:37:52 · 826 阅读 · 0 评论 -
NYOJ491幸运三角形(DFS)
幸运三角形时间限制:1000 ms | 内存限制:65535 KB难度:3描述 话说有这么一个图形,只有两种符号组成(‘+’或者‘-’),图形的最上层有n个符号,往下个数依次减一,形成倒置的金字塔形状,除第一层外(第一层为所有可能情况),每层形状都由上层决定,相邻的符号相同,则下层的符号为‘+’,反之,为‘-’;如下图所示(n = 3 时的原创 2014-06-27 18:52:27 · 777 阅读 · 0 评论 -
南阳 21 三个水杯
三个水杯时间限制:1000 ms | 内存限制:65535 KB难度:4描述给出三个水杯,大小不一,并且只有最大的水杯的水是装满的,其余两个为空杯子。三个水杯之间相互倒水,并且水杯没有标识,只能根据给出的水杯体积来计算。现在要求你写出一个程序,使其输出使初始状态到达目标状态的最少次数。输入第一行一个整数N(0接下来每组测试数据有两行,第一行给出三原创 2014-06-24 17:51:35 · 1015 阅读 · 0 评论 -
南阳448 素数环(DFS)
素数环时间限制:1000 ms | 内存限制:65535 KB难度:2描述有一个整数n,把从1到n的数字无重复的排列成环,且使每相邻两个数(包括首尾)的和都为素数,称为素数环。为了简便起见,我们规定每个素数环都从1开始。例如,下图就是6的一个素数环。输入有多组测试数据,每组输入一个n(0输出每组第一行输出对应的Case序号原创 2014-05-27 16:16:50 · 785 阅读 · 0 评论 -
吝啬的国度(DFS)
吝啬的国度时间限制:1000 ms | 内存限制:65535 KB难度:3描述 在一个吝啬的国度里有N个城市,这N个城市间只有N-1条路把这个N个城市连接起来。现在,Tom在第S号城市,他有张该国地图,他想知道如果自己要去参观第T号城市,必须经过的前一个城市是几号城市(假设你不走重复的路)。输入第一行输入一个整数M表示测试数据共有M(1每组测试数据的第一行输原创 2014-05-18 18:04:46 · 713 阅读 · 0 评论 -
nyoj586 &poj 2456
疯牛时间限制:1000 ms | 内存限制:65535 KB难度:4描述农夫 John 建造了一座很长的畜栏,它包括N (2 但是,John的C (2 输入有多组测试数据,以EOF结束。第一行:空格分隔的两个整数N和C第二行——第N+1行:分别指出了xi的位置输出每组测试数据输出一个整数,满足题意的最大的最小值,注意换行。样例输入原创 2014-06-30 01:19:53 · 819 阅读 · 0 评论 -
杭电1045 Fire Net(DFS)
Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6351 Accepted Submission(s): 3592Problem DescriptionSuppose that we have原创 2014-08-19 15:49:40 · 571 阅读 · 0 评论 -
杭电 2510 符号三角形(DFS与南阳的一样)
符号三角形Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 895 Accepted Submission(s): 454Problem Description符号三角形的 第1行有n个由“+”和”-“组成的符号原创 2014-08-21 15:04:26 · 847 阅读 · 0 评论 -
poj3984 迷宫问题(BFS)
迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7902 Accepted: 4649Description定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0,原创 2014-08-24 13:28:54 · 807 阅读 · 0 评论 -
杭电1026 Ignatius and the Princess I(BFS+路径记录)
Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12019 Accepted Submission(s): 3789Special JudgeProblem D原创 2014-08-11 13:13:21 · 508 阅读 · 0 评论 -
杭电1016 Prime Ring Problem(DFS)
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26950 Accepted Submission(s): 12028Problem DescriptionA ring is原创 2014-08-24 15:10:58 · 607 阅读 · 0 评论