# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
966806 | pcc | Bold (COCI21_bold) | C++17 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
const int mxn = 110;
string arr[mxn];
string ans[mxn];
int n,m;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>m;
for(int i = 0;i<n;i++){
cin>>arr[i];
ans[i] = arr[i];
}
for(int i = 0;i<n;i++){
for(int j = 0;j<m;j++){
if(arr[i][j] == '#'){
ans[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';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |