算法-BFS/DFS - 随笔分类(第2页) - happy_codes

M - Tempter of the Bone(DFS,奇偶剪枝)

摘要：M - Tempter of the Bone Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u M - Tempter of the Bone Description The doggie found a bo 阅读全文

posted @ 2016-07-16 16:41 happy_codes 阅读(192) 评论(0) 推荐(0)

K - Children of the Candy Corn(待续)

摘要：K - Children of the Candy Corn Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u K - Children of the Candy Corn Time Limit:1000MS M 阅读全文

posted @ 2016-07-16 16:34 happy_codes 阅读(187) 评论(0) 推荐(0)

L - Sum It Up(DFS)

摘要：L - Sum It Up Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u L - Sum It Up Time Limit:1000MS Memory Limit:10000KB 64bit IO Forma 阅读全文

posted @ 2016-07-16 16:34 happy_codes 阅读(183) 评论(0) 推荐(0)

J - 迷宫问题(BFS)

摘要：J - 迷宫问题 Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u J - 迷宫问题 Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & 阅读全文

posted @ 2016-07-16 16:32 happy_codes 阅读(193) 评论(0) 推荐(0)

H - N皇后问题

摘要：H - N皇后问题 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u H - N皇后问题 Description 在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不阅读全文

posted @ 2016-07-16 16:28 happy_codes 阅读(310) 评论(0) 推荐(0)

G - Oil Deposits(dfs)

摘要：G - Oil Deposits Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u G - Oil Deposits Time Limit:1000MS Memory Limit:32768KB 64bit IO 阅读全文

posted @ 2016-07-16 16:18 happy_codes 阅读(149) 评论(0) 推荐(0)

C - Dungeon Master

摘要：C - Dungeon Master Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u C - Dungeon Master Description You are trapped in a 3D dungeon 阅读全文

posted @ 2016-07-16 15:59 happy_codes 阅读(127) 评论(0) 推荐(0)

B - Catch That Cow (抓牛)

摘要：B - Catch That Cow Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u B - Catch That Cow Description Farmer John has been informed o 阅读全文

posted @ 2016-07-16 15:57 happy_codes 阅读(268) 评论(0) 推荐(0)

happy_code

随笔分类 - 算法-BFS/DFS

公告