解题思路:
注意事项:
参考代码:
#include<iostream> #include<cstring> #include<algorithm> using namespace std; const int N = 1e2 + 10; int d[8][2] = {{0,1},{0,-1},{-1,-1},{-1,1},{1,1},{1,-1},{1, 0},{-1, 0}}; int a[N][N],f[N][N]; int main() { int n,m,cnt = 1; while(cin >> n >> m && n > 0) { for(int i = 0; i < n; i ++) for(int j = 0; j < m; j ++){ char c; cin >> c; if(c == '*') a[i][j] = 1; } for(int i = 0; i < n; i ++) for(int j = 0; j < m; j ++) for(int k = 0; k < 8; k ++){ int nx = d[k][0] + i; int ny = d[k][1] + j; if(nx >= 0 && nx < n && ny >= 0 && ny < m){ if(a[nx][ny] == 1) f[i][j] ++; } } cout << "Field #" << cnt++ << ":"<<endl; for(int i = 0; i < n; i ++){ for(int j = 0; j < m; j ++){ if(a[i][j] == 1) cout << '*'; else cout << f[i][j]; } cout << endl; } cout << endl; memset(a,0, sizeof a); memset(f,0, sizeof f); } return 0; }
0.0分
0 人评分
简单的a+b (C语言代码)浏览:657 |
简单的a+b (C语言代码)浏览:566 |
C语言程序设计教程(第三版)课后习题1.6 (C++代码)浏览:905 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:596 |
兰顿蚂蚁 (C++代码)浏览:1106 |
简单的a+b (C语言代码)浏览:362 |
2005年春浙江省计算机等级考试二级C 编程题(2) (C语言代码)浏览:658 |
The 3n + 1 problem (C语言代码)浏览:570 |
1009题解浏览:763 |
C语言程序设计教程(第三版)课后习题9.6 (C语言代码)浏览:594 |