答案:<pre class="brush:cpp;toolbar:false">// C++参考代码1
// 数据量比较小 暴力模拟即可
#include <bits/stdc++.h>
using namespace std;
int a[10][10], b[10][10];
int dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
int dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
int main() {
int n, m;
cin >> m >> n;
a[5][5] = m;
for (int k = 1; k <= n; k++) { // n天
memset(b, 0, sizeof(b)); // 清空b
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++) {
if (a[i][j] > 0) {
b[i][j] += a[i][j] * 2; // 原单元格
for (int t = 0; t < 8; t++) { // 向四周8个单元格扩散
if (i + dx[t] >= 1 && i + dx[t] <= 9 && j + dy[t] >= 1 &&
j + dy[t] <= 9)
b[i + dx[t]][j + dy[t]] += a[i][j];
}
}
}
memcpy(a, b, sizeof(b));
}
// 输出
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++)
cout << a[i][j] << " ";
cout << endl;
}
return 0;
}</pre><pre class="brush:cpp;toolbar:false">// C++参考代码2
#include <iostream>
int main() {
int m, n, a[10][10] = {0}, b[10][10] = {0};
std::cin >> m >> n;
a[5][5] = m;
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
if (a[i][j] != 0) {
for (int x = i - 1; x <= i + 1; x++) {
for (int y = j - 1; y <= j + 1; y++) {
if (x == i && y == j) {
b[x][y] += 2 * a[i][j];
} else {
b[x][y] += a[i][j];
}
}
}
}
}
}
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
a[i][j] = b[i][j];
b[i][j] = 0;
}
}
}
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
std::cout << a[i][j] << " ";
}
std::cout << std::endl;
}
return 0;
}</pre><pre class="brush:cpp;toolbar:false">// C语言参考代码
#include <stdio.h>
int main() {
int m, n, a[10][10] = {0}, b[10][10] = {0};
scanf("%d %d", &m, &n);
a[5][5] = m;
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
if (a[i][j] != 0) {
for (int x = i - 1; x <= i + 1; x++) {
for (int y = j - 1; y <= j + 1; y++) {
if (x == i && y == j) {
b[x][y] = b[x][y] + 2 * a[i][j];
} else {
b[x][y] = b[x][y] + a[i][j];
}
}
}
}
}
}
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
a[i][j] = b[i][j];
b[i][j] = 0;
}
}
}
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
printf("%d ", a[i][j]);
}
printf("\n");
}
return 0;
}</pre>
这道题暂未补解析。