DFS
L-75
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
SDUT 2410 Mine Number 2012年山东省第三届ACM大学生程序设计竞赛题
Mine Number Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描述 Every one once played the game called Mine Sweeping, here I change the rule. You are given an n*m map, every element i原创 2016-05-19 07:00:26 · 509 阅读 · 0 评论 -
HDU 2660 Accepted Necklace (01背包,dfs)
Accepted NecklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3696 Accepted Submission(s): 1465Problem DescriptionI have N precious stone原创 2017-03-16 20:49:29 · 440 阅读 · 0 评论 -
CodeForces - 589J Cleaner Robot
J. Cleaner Robottime limit per test2 seconds memory limit per test512 megabytes inputstandard input outputstandard output Masha has recently bought a cleaner robot, it can clean a floor without any原创 2017-03-05 09:19:10 · 465 阅读 · 0 评论 -
poj 3984 迷宫问题
迷宫问题 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18533 Accepted: 10970 Description 定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0,原创 2017-02-01 00:14:48 · 441 阅读 · 0 评论 -
poj 3050 Hopscotch(dfs暴力)
Hopscotch Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3951 Accepted: 2627 Description The cows play the child's game of hopscotch in a non-traditional原创 2017-02-14 10:59:00 · 460 阅读 · 0 评论 -
HDU 1518 Square(DFS+剪枝)
Square Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13846 Accepted Submission(s): 4386 Problem Description Given a set of st原创 2016-12-27 13:12:47 · 485 阅读 · 0 评论 -
符号三角形问题(dfs)
符号三角形 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1800 Accepted Submission(s): 930 Problem Description 符号三角形的 第1行有n个由“+”和”-“原创 2016-12-02 11:48:18 · 769 阅读 · 0 评论 -
poj 2488 A Knight's Journey (dfs)
A Knight's Journey Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 42114 Accepted: 14324 Description Background The knight is getting bored of seeing t原创 2016-10-16 21:52:22 · 361 阅读 · 0 评论 -
poj 3009 Curling 2.0
Curling 2.0 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18688 Accepted: 7666 Description On Planet MM-21, after their Olympic games this year, curlin原创 2016-10-22 11:52:01 · 514 阅读 · 0 评论 -
poj 1166 The Clocks (暴力|| dfs)
The Clocks Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16196 Accepted: 6627 Description |-------| |-------| |-------| | | | |原创 2016-09-20 13:38:16 · 555 阅读 · 0 评论 -
POJ 1753 Flip Game(回溯查找,dfs)
Flip Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 39171 Accepted: 17026 Description Flip game is played on a rectangular 4x4 field with two-sided p原创 2016-06-23 16:06:48 · 488 阅读 · 0 评论 -
POJ 2965 The Pilots Brothers' refrigerator(回溯查找,dfs)
The Pilots Brothers' refrigerator Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 23414 Accepted: 9004 Special Judge Description The game “The Pilo原创 2016-06-25 20:10:27 · 367 阅读 · 0 评论 -
HDU 1242 Rescue
Rescue Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 22768 Accepted Submission(s): 8045 Problem Description Angel was caught by th原创 2015-12-15 00:18:28 · 402 阅读 · 0 评论 -
穿越雷区第六届蓝桥杯大赛个人赛决赛(C语言A组)第四题
标题:穿越雷区 X星的坦克战车很奇怪,它必须交替地穿越正能量辐射区和负能量辐射区才能保持正常运转,否则将报废。 某坦克需要从A区到B区去(A,B区本身是安全区,没有正能量或负能量特征),怎样走才能路径最短? 已知的地图是一个方阵,上面用字母标出了A,B区,其它区都标了正号或负号分别表示正负能量辐射区。 例如: A + - + - - + - - + - + + + -原创 2016-05-24 13:56:54 · 2187 阅读 · 0 评论 -
HDU 1181 变形课(DFS)
变形课 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other) Total Submission(s) : 5 Accepted Submission(s) : 1 Font: Times New Roman | Verdana | Georgia Font Size: ←原创 2015-12-08 14:46:15 · 475 阅读 · 0 评论 -
HDU 1016 Prime Ring Problem(DFS入门)
Prime Ring Problem Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 36781 Accepted Submission(s): 16202 Problem Description A ring is原创 2015-12-05 17:42:55 · 483 阅读 · 0 评论 -
HDU 1175 连连看 (DFS + 剪枝)
连连看 Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26235 Accepted Submission(s): 6501 Problem Description “连连看”相信很多人都玩过。没玩过也没关系,下原创 2015-12-06 20:52:15 · 903 阅读 · 0 评论 -
蓝桥杯 李白打酒
标题:李白打酒 话说大诗人李白,一生好饮。幸好他从不开车。 一天,他提着酒壶,从家里出来,酒壶中有酒2斗。他边走边唱: 无事街上走,提壶去打酒。 逢店加一倍,遇花喝一斗。 这一路上,他一共遇到店5次,遇到花10次,已知最后一次遇到的是花,他正好把酒喝光了。 请你计算李白遇到店和花的次序,可以把遇店记为a,遇花记为b。原创 2016-01-20 11:13:33 · 904 阅读 · 0 评论 -
HDU 2553 N皇后问题
N皇后问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 14958 Accepted Submission(s): 6813 Problem Description 在N*N的方格棋盘放置了N个皇后,使得它们原创 2016-01-20 10:59:13 · 438 阅读 · 0 评论 -
蓝桥杯 历届试题 剪格子
问题描述 如下图所示,3 x 3 的格子中填写了一些整数。 +--*--+--+ |10* 1|52| +--****--+ |20|30* 1| *******--+ | 1| 2| 3| +--+--+--+ 我们沿着图中的星号线剪开,得到两个部分,每个部分的数字和都是60。 本题的要求就是请你编程判定:对给定的m x n 的格子中的整数,是否可以分割为两个部分,使得这原创 2016-01-18 15:20:14 · 938 阅读 · 0 评论 -
HDU 1258 Sum It Up
Sum It Up Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 4 Accepted Submission(s) : 1 Font: Times New Roman | Verdana | Georgia Font Si原创 2016-01-19 17:31:13 · 389 阅读 · 0 评论 -
蓝桥杯 历届试题 带分数
问题描述 100 可以表示为带分数的形式:100 = 3 + 69258 / 714。 还可以表示为:100 = 82 + 3546 / 197。 注意特征:带分数中,数字1~9分别出现且只出现一次(不包含0)。 类似这样的带分数,100 有 11 种表示法。 输入格式 从标准输入读入一个正整数N (N 输出格式 程序输出该数字用数码1~9不重复不遗漏地组成带分原创 2016-01-18 15:29:19 · 1134 阅读 · 0 评论 -
HDU 1213 How Many Tables
How Many Tables Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20247 Accepted Submission(s): 10076 Problem Description Today is I原创 2016-01-16 17:24:37 · 372 阅读 · 0 评论
分享