随笔分类 -  搜索

poj 1062 昂贵的聘礼 dijkstra
摘要:昂贵的聘礼Time Limit:1000MSMemory Limit:10000KTotal Submissions:26963Accepted:7521Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。"探险家就跑到大祭司那里,向他要求皮袄或水晶球,大祭司要他用金币来换,或者替他弄来其他的东西,他可 阅读全文
posted @ 2012-08-01 17:01 Zee、 阅读(445) 评论(0) 推荐(0)
poj 2676 sudoku dfs
摘要:SudokuTime Limit:2000MSMemory Limit:65536KTotal Submissions:10299Accepted:5141Special JudgeDescriptionSudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cells are written decimal digits from 1 to 9. The ot 阅读全文
posted @ 2012-08-01 10:03 Zee、 阅读(327) 评论(0) 推荐(0)
poj Prime Path BFS
摘要:Prime PathTime Limit:1000MSMemory Limit:65536KTotal Submissions:7550Accepted:4281DescriptionThe ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices.— It is a matter of security to 阅读全文
posted @ 2012-07-30 15:43 Zee、 阅读(262) 评论(0) 推荐(0)
poj 3278 BFS
摘要:Catch That CowTime Limit:2000MSMemory Limit:65536KTotal Submissions:30928Accepted:9537DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN(0 ≤N≤ 100,000) on a number line and the cow is at a pointK(0 ≤K≤ 100,000) on the 阅读全文
posted @ 2012-07-30 10:05 Zee、 阅读(176) 评论(0) 推荐(0)
poj 3083 DFS 和BFS
摘要:Children of the Candy CornTime Limit:1000MSMemory Limit:65536KTotal Submissions:6630Accepted:2891DescriptionThe cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terrors on t 阅读全文
posted @ 2012-07-28 16:13 Zee、 阅读(721) 评论(0) 推荐(0)
poj 2251 BFS
摘要:Dungeon MasterTime Limit:1000MSMemory Limit:65536KTotal Submissions:11753Accepted:4560DescriptionYou 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 filled with rock. It takes one minute to move one unit north, south, e 阅读全文
posted @ 2012-07-27 15:39 Zee、 阅读(179) 评论(0) 推荐(0)
poj 2488 DFS
摘要:A Knight's JourneyTime Limit : 2000/1000ms (Java/Other)Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 10Accepted Submission(s) : 4Problem DescriptionBackgroundThe knight is getting bored of seeing the same black and white squares again and again and has decided to make a journeya 阅读全文
posted @ 2012-07-25 21:35 Zee、 阅读(191) 评论(0) 推荐(0)
poj 1426 DFS
摘要:Find The MultipleTime Limit:1000MSMemory Limit:10000KTotal Submissions:12137Accepted:4993Special JudgeDescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 阅读全文
posted @ 2012-07-25 15:43 Zee、 阅读(224) 评论(0) 推荐(0)