广搜
来源:互联网 发布:数组转化为json 编辑:程序博客网 时间:2024/03/29 22:29
Problem Description
There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can move only on black tiles.
Write a program to count the number of black tiles which he can reach by repeating the moves described above.
Write a program to count the number of black tiles which he can reach by repeating the moves described above.
Input
The input consists of multiple data sets. A data set starts with a line containing two positive integers W and H; W and H are the numbers of tiles in the x- and y- directions, respectively. W and H are not more than 20.
There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.
'.' - a black tile
'#' - a red tile
'@' - a man on a black tile(appears exactly once in a data set)
There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.
'.' - a black tile
'#' - a red tile
'@' - a man on a black tile(appears exactly once in a data set)
Output
For each data set, your program should output a line which contains the number of tiles he can reach from the initial tile (including itself).
0 0
- 广搜
- 广搜
- 广搜
- 广搜
- 广搜
- 广搜
- POJ_3278_广搜
- 深搜 广搜
- hdu 1026 广搜
- 1242 rescue 广搜
- zoj 1091 广搜。
- POJ3083 广搜&模拟
- poj3278基本广搜
- POJ3414广搜&回溯
- nysit 20 广搜
- 双向广搜
- 双向广搜
- 深搜&&广搜_Poj_3083
- Android 对话框(Dialog) 及 自定义Dialog
- codeforces 516E
- CentOS安装VNC
- 260 Single Number III
- 面试点:解读关键字volatile
- 广搜
- Java异常体系结构
- Android设计模式系列--观察者模式
- 设置CListCtrl某一行背景颜色
- AGFA 3rd MUSICA algorithm
- Hibernate SQL查询:No Dialect mapping for JDBC type: -9
- 【保研】2015计算机类保研夏令营感悟3(中山大学卡内基梅隆大学联合工程学院JIE)
- Android adb无线调试,无需越狱
- tomcat 启动时 报 UnknownHostException