UVa 572 Oil Deposits
来源:互联网 发布:电脑屏幕自动截图软件 编辑:程序博客网 时间:2024/06/06 18:47
遇到一个@就把相连的@全变成‘*’,再cnt++就好
#include<iostream>#include<cstdio>#include<cstring>using namespace std;char oil[105][105];int m,n;void dfs(int i,int j);int main(){while(scanf("%d%d",&m,&n)&&m){int cnt=0;memset(oil,0,sizeof(oil));for(int i=0;i<m;i++) cin>>oil[i];for(int i=0;i<m;i++)for(int j=0;j<n;j++)if(oil[i][j]=='@')dfs(i,j),cnt++;cout<<cnt<<endl;}return 0;}void dfs(int i,int j){if(i<0||i>=m||j<0||j>=n) return ;oil[i][j]='*';for(int dx=-1;dx<=1;dx++)for(int dy=-1;dy<=1;dy++)if(oil[i+dx][j+dy]=='@') dfs(i+dx,j+dy);}
0 0
- uva 572 - Oil Deposits
- uva 572 - Oil Deposits
- uva 572 - Oil Deposits
- uva-572-Oil Deposits
- UVa 572 - Oil Deposits
- UVa 572 - Oil Deposits
- UVa 572 - Oil Deposits
- uva 572Oil Deposits
- UVa 572Oil Deposits
- UVa 572 - Oil Deposits
- UVa 572: Oil Deposits
- uva 572 Oil Deposits
- UVa 572 - Oil Deposits
- uva 572 oil Deposits
- uva 572 - Oil Deposits
- uva 572 - Oil Deposits
- UVa 572 - Oil Deposits
- UVA 572 Oil Deposits
- 【GDOI2016模拟4.23】数字方阵
- LeetCode *** 179. Largest Number (sort的使用。。。)
- 理解神经网络
- 【理解】 有向图强连通分量 Tarjan算法
- Java Web防止表单重复提交
- UVa 572 Oil Deposits
- ZOJ 3946-Highway Project【最短路的应用】(2016浙江省大学生程序设计竞赛)
- github小练习004
- [leetcode] 145. Binary Tree Postorder Traversal
- linux环境jdk安装及配置
- linux常用命令
- IaaS, PaaS和SaaS公司都做些什么
- JAVA BigDecimal 小数处理
- hdu 5670