随缘&不屈 - 博客园

UVA120-Stacks of Flapjacks(思维)

摘要： Problem UVA120-Stacks of Flapjacks Accept: 9232 Submit: 38455Time Limit: 10000 mSec Problem Description Input The input consists of a sequence of stac 阅读全文

posted @ 2018-09-08 22:00 随缘&不屈阅读(274) 评论(0) 推荐(0) 编辑

UVA10384-The Wall Pushers（迭代加深搜索）

摘要： Problem UVA10384-The Wall Pushers Accept: 199 Submit: 1546Time Limit: 10000 mSec Problem Description Input The input ﬁle may contain several mazes to 阅读全文

posted @ 2018-09-08 01:52 随缘&不屈阅读(329) 评论(0) 推荐(0) 编辑

UVA11694-Gokigen Naname（DFS进阶）

摘要： Problem UVA11694-Gokigen Naname Accept: 76 Submit: 586Time Limit: 10000 mSec Problem Description Input The ﬁrst line of the input ﬁle contains an inte 阅读全文

posted @ 2018-09-08 00:35 随缘&不屈阅读(495) 评论(0) 推荐(0) 编辑

UVA11846-Finding Seats Again(DFS)

摘要： Problem UVA11846-Finding Seats Again Accept: 69 Submit: 433Time Limit: 10000 mSec Problem Description A set of n2 computer scientists went to the movi 阅读全文

posted @ 2018-09-07 16:09 随缘&不屈阅读(532) 评论(0) 推荐(0) 编辑

UVA11882-Biggest Number(DFS+最优化剪枝)

摘要： Problem UVA11882-Biggest Number Accept: 177 Submit: 3117Time Limit: 1000 mSec Memory Limit : 128MB Problem Description Input There will be at most 25 阅读全文

posted @ 2018-09-07 11:35 随缘&不屈阅读(555) 评论(0) 推荐(0) 编辑

UVA817-According to Bartjens（DFS）

摘要： Problem UVA817-According to Bartjens Accept: 270 Submit: 2071Time Limit: 1000 mSec Memory Limit : 128MB Problem Description The wide dissemination of 阅读全文

posted @ 2018-09-07 01:07 随缘&不屈阅读(418) 评论(0) 推荐(0) 编辑

UVA1533-Moving Pegs（BFS+状态压缩）

摘要： Problem UVA1533-Moving Pegs Accept：106 Submit：375 Time Limit: 3000 mSec Problem Description Input The input consists of T test cases. The number of te 阅读全文

posted @ 2018-09-06 20:37 随缘&不屈阅读(386) 评论(0) 推荐(0) 编辑

UVA12569-Planning mobile robot on Tree (EASY Version)（BFS+状态压缩）

摘要： Problem UVA12569-Planning mobile robot on Tree (EASY Version) Accept：138 Submit：686 Time Limit: 3000 mSec Problem Description Input The first line con 阅读全文

posted @ 2018-09-06 18:32 随缘&不屈阅读(218) 评论(0) 推荐(0) 编辑

UVA12107-Digit Puzzle（迭代加深搜索）

摘要： Problem UVA12107-Digit Puzzle Accept：85 Submit：612 Time Limit: 3000 mSec Problem Description Input The input contains several test cases. Each test ca 阅读全文

posted @ 2018-09-04 23:57 随缘&不屈阅读(590) 评论(0) 推荐(0) 编辑

UVA12558-Efyptian Fractions(HARD version)(迭代加深搜索)

摘要： Problem UVA12558-Efyptian Fractions(HARD version) Accept：187 Submit：3183 Time Limit: 3000 mSec Problem Description Given a fraction a/b, write it as a 阅读全文

posted @ 2018-09-03 23:49 随缘&不屈阅读(279) 评论(0) 推荐(0) 编辑