#include"iostream"
#include"vector"
// #include"queue"
// #include"deque"
// #include"set"
// #include"map"
// #include"algorithm"
// #include"cstring"
// #define int long long
using namespace std;
const int maxn = 105;
string str[maxn+5];
string ans[maxn+5];
void solve(){
int n,m;
cin >> n >> m;
for(int i=0;i<n;i++){
cin >> str[i];
ans[i] = str[i];
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(str[i][j]=='#'){
ans[i+1][j]='#';
ans[i][j+1]='#';
ans[i+1][j+1]='#';
}
}
}
for(int i=0;i<n;i++){
cout << ans[i] << "\n";
}
}
signed main(){
ios::sync_with_stdio(false); cin.tie(0);
// freopen("","r",stdin);freopen("","w",stdout);
int t=1;
// cin >>t;
for(int i=1;i<=t;i++){
// cout << "Case " << i << ":\n";
solve();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |