func_code_string: #include <bits/stdc++.h>   using namespace std;   int caseno = 1;   typedef long long LL;   typedef unsigned long long ULL;   template <class T>   inline void SWAP(T &a, T &b) {     T t = a;     a = b;     b = t;   }   inline LL POW(LL base, LL power) {     LL res = base;     if (power == 0) return 1;     for (int I = 0; I < power - 1; I++) res *= base;     return res;   }   int ToInt(string s) {     int r = 0;     istringstream sin(s);     sin >> r;     return r;   }   double ToDouble(string s) {     double r = 0;     istringstream sin(s);     sin >> r;     return r;   }   string ToString(int n) {     string s;     stringstream convert;     convert << n;     s = convert.str();     return s;   }   const int SIZE = 500 + 10;   string S[SIZE];   int main() {     std::ios_base::sync_with_stdio(0);     int T, I, J, K, N, n, m, k, cnt = 0, len, R, C;     cin >> R >> C;     for (I = 0; I < R; I++) cin >> S[I];     for (I = 0; I < R; I++) {       for (J = 0; J < C; J++) {         if (S[I][J] ==  . ) S[I][J] =  D ;       }     }     for (I = 0; I < R; I++) {       for (J = 0; J < C; J++) {         if (S[I][J] ==  S  && ((J + 1 < C && S[I][J + 1] ==  W ) ||                                (J - 1 >= 0 && S[I][J - 1] ==  W ) ||                                (I + 1 < R && S[I + 1][J] ==  W ) ||                                (I - 1 >= 0 && S[I - 1][J] ==  W ))) {           cout <<  No n ;           return 0;         }       }     }     cout <<  Yes n ;     for (I = 0; I < R; I++) {       for (J = 0; J < C; J++) cout << S[I][J];       cout <<   n ;     }     return 0;   }   