POJ
友谊无价
CQUPT的蒟蒻
展开
-
[POJ] 2485 Highways
题目: The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem. They’re原创 2017-03-11 08:53:17 · 296 阅读 · 0 评论 -
[POJ] 1258 Agri-Net
题目: Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course. Farmer John ordered a hig原创 2017-03-11 08:55:51 · 337 阅读 · 0 评论 -
[POJ] 1509 Glass Beads
题目: Ray又对数字的列产生了兴趣: 现有四张卡片,用这四张卡片能排列出很多不同的4位数,要求按从小到大的顺序输出这些4位数。 Input 每组数据占一行,代表四张卡片上的数字(0<=数字<=9),如果四张卡片都是0,则输入结束。 Output 对每组卡片按从小到大的顺序输出所有能由这四张卡片组成的4位数,千位数字相同的在同一行,同一行中每个四位数间用空格分隔。 每组输出数据间原创 2017-04-01 22:01:17 · 336 阅读 · 0 评论 -
[POJ] 3984 迷宫问题
题意:给定一个5*5的迷宫,求从左上角到右下角的最短路径。分析:BFS跑一下最短路,这里学习一下保存输出最短路径的方法。代码:#include<stdio.h> #include<cstring> #include<algorithm> #include<iostream>#include<vector>#include<set>#include<string>#include<原创 2017-05-11 19:12:53 · 215 阅读 · 0 评论 -
[POJ] 2251 Dungeon Master
题目: https://vjudge.net/contest/156770#problem/B题意: 一个三维的地牢,依次给出地牢的高长宽,并给出每一层的具体内容。S起点,E终点,求最短的步数。分析: 一眼看就是三维的DFS或BFS,然后不信邪,跑了一下DFS就TLE了,最后跑个BFS才过的。把以前的4个方向变成6个就可以了。 代码:#include<stdio.h> #include<c原创 2017-04-27 16:10:34 · 594 阅读 · 0 评论