DFS
Singular__point
stay foolish ,stay hungry !
展开
-
警匪请拨110
问题描述: 请看算式: 12+3+4+5+6+7+8+9=110 可以在1~9之间填入 + - 或不填(1 2之间不填表示12) 请用计算机算出其余的情况,例如:12+34+56+7-8+9=110 123+4+5+67-89=110 . . . 各答案的出场顺序不做要求。 解题思路: 利用深搜算法d原创 2016-09-26 17:35:12 · 729 阅读 · 0 评论 -
HDU 1016 Prime Ring Problem
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44768 Accepted Submission(s): 19845Problem DescriptionA rin原创 2016-11-25 17:18:43 · 252 阅读 · 0 评论 -
DFS J. Cleaner Robot Codeforce 589J(实例与分析)
J. Cleaner Robottime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputMasha has recently bought a cleaner robot,原创 2017-03-05 16:14:54 · 374 阅读 · 0 评论 -
DFS 奇偶剪枝 HDU 1010
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 120609 Accepted Submission(s): 32558Problem DescriptionThe原创 2017-05-03 07:50:15 · 282 阅读 · 0 评论 -
hdu 2553 n皇后问题
N皇后问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21779 Accepted Submission(s): 9744Problem Description在N*N的方格棋盘放置了N个皇后,使得原创 2017-03-08 19:26:01 · 399 阅读 · 0 评论