Submission #10341824

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define REP(i, n) for(ll i = 1; i < (ll)(n); i++)
#define P pair<ll, ll>
typedef long long ll;
const ll mod = 1e9+7;

template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}

//繰り返し自乗法によるmod累乗計算
//a = 底、　n = 指数
ll modpow(ll a, ll n){
  if(n == 0) return 1;
  if(n%2 == 0){
    ll res = modpow(a, n/2);
    return res * res % mod;
  }
  return a * modpow(a, n-1) % mod;
}
//nCa 
ll modcom(ll n, ll a){
  ll x = 1, y = 1;
  rep(i, a){
    x = x * (n-i) % mod;
    y = y * (i+1) % mod;
  }
  ll ans = x * modpow(y, mod-2) % mod;
  return ans;
}

int main(){
  int h, w;
  cin >> h >> w;
  char mp[55][55];
  rep(i,h)rep(j,w) cin >> mp[i][j];
  int a[55][55] = {};

  rep(i,h){
    rep(j,w){
      if(mp[i][j] == '.'){
        for(int di = i-1; di <= i+1; di++){
          for(int dj = j-1; dj <= j+1; dj++){
            if(di < 0 || dj < 0 || di >= h || dj >= w) continue;
            if(mp[di][dj] == '#') a[i][j]++;
          }
        }
      }
      else{
        a[i][j] = -1;
      }
    }
  }

  rep(i,h){
    rep(j,w){
      if(a[i][j] == -1) cout << '#';
      else cout << a[i][j];
    }
    cout << endl;
  }
}

Submission Info

Judge Result