Submission #10342588

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>

#define cal(i, n) for(int i = 0 ; i < n ; i++)
#define find(i, p, n) for(int i = p ; i <= n; i++)

using namespace std;

int main(){
    int H, W;
    vector<string> S(50);
    cin >> H >> W;
    cal(i, H) cin >> S[i];
    cal(i, H){
        cal(j, W){
            if(S[i].substr(j,1) != "#"){
                int count = 0;
                int imin = i - 1; int imax = i + 1;
                int jmin = j - 1; int jmax = j + 1;
                if(imin < 0){
                    imin = 0;
                }
                if(jmin < 0){
                    jmin = 0;
                }
                if(imax >= H){
                    imax = H - 1;
                }
                if(jmax >= W){
                    jmax = W - 1;
                }
                find(k, imin, imax) find(l, jmin, jmax) if(S[k].substr(l,1) == "#")count++;
                S[i].replace(j, 1, to_string(count));
            }
        }
    }
    cal(i, H) cout << S[i] << endl;
    
    return 0;
}

Submission Info

Judge Result