文件名称:zoumigongsheji
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:592byte
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
有一个m*n格的迷宫(表示有m行、n列),其中有可走的也有不可走的,如果用1表示可以走,0表示不可以走,文件读入这m*n个数据和起始点、结束点(起始点和结束点都是用两个数据来描述的,分别表示这个点的行号和列号)。现在要你编程找出所有可行的道路,要求所走的路中没有重复的点,走时只能是上下左右四个方向。如果一条路都不可行,则输出相应信息(用-l表示无路)。 -A m* n grid of a maze (that has m lines, n out), which may also not go away, if that can go with 1, 0 that can not leave, this document is read into m* n data and the starting point and end point (the starting point and end point are used to describe the two data, respectively, the point that the line number and column number). Programming you have to find all possible roads, the request path does not repeat the point, can only be walking up and down around the four directions. If a road is not feasible, then output the corresponding information (that have no use-l).
(系统自动生成,下载前可以参看下载内容)
下载文件列表
MiGong.cpp
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.