Сапер

#include <iostream>
 
using namespace std;
 
int main()
{
int n,m,k;
cin >> n >> m >> k;
int a=k,p1[a],p2[a];
a=1;
while(k>0){
k--;
cin >> p1[a] >> p2[a];
a++;
}
a--;
int count=0,h=0,g,f=0;
for(int i = 1; i<=n;i++,cout<<endl){
for(int j = 1;j<=m;j++){
for(int toy=1;toy<=a;toy++){
if(i==p1[toy]&&j==p2[toy]) h=1;
else {
if(i-1==p1[toy]&&j==p2[toy]) count++;
if(i+1==p1[toy]&&j==p2[toy]) count++;
if(i==p1[toy]&&j-1==p2[toy]) count++;
if(i==p1[toy]&&j+1==p2[toy]) count++;
if(i-1==p1[toy]&&j-1==p2[toy]) count++;
if(i+1==p1[toy]&&j+1==p2[toy]) count++;
if(i-1==p1[toy]&&j+1==p2[toy]) count++;
if(i+1==p1[toy]&&j-1==p2[toy]) count++;
if(i==1&&j==1) f=1;
g+=count;
count=0;
}
}
if(h==1)    cout<<"* ";
else cout<<g+f<<" ";
h=0,g=0,f=0;
}
}   
return 0;
}

#include <iostream>
using namespace std;
 
int N, M;
int **field;
 
void calc(int x, int y) {
    if (x < 0 || y < 0 || x >= N || y >= M) return;
    if (field[x][y] != '*') field[x][y]++;
}
 
void addMine(int x, int y) {
    if (x < 0 || y < 0 || x >= N || y >= M) return;
    field[x][y] = '*';
    calc(x - 1, y);
    calc(x + 1, y);
    calc(x, y - 1);
    calc(x, y + 1);
    calc(x - 1, y - 1);
    calc(x + 1, y + 1);
    calc(x - 1, y + 1);
    calc(x + 1, y - 1);
}
 
int main(){
    cin >> N >> M;
    field = new int*[N];
    for (int i = 0; i < N; i++) {
        field[i] = new int[M];
        for (int j = 0; j < M; j++) field[i][j] = 0;
    }
 
    int k; cin >> k;
    while (k--) {
        int x, y;
        cin >> x >> y;
        addMine(x, y);
    }
 
    cout << endl;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
            if (field[i][j] != '*') cout << field[i][j];
            else cout << '*';
            if (j < M - 1) cout << ' ';
        }
        cout << endl;
    }
 
    for (int i = 0; i < N; i++) delete[] field[i];
    delete[] field;
    return 0;
}