# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
476578 | mychecksedad | Bold (COCI21_bold) | C++17 | 1 ms | 204 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;
typedef long long int ll;
#define pb push_back
#define all(x) x.begin(), x.end()
const int N = 110, M = 1e5+10, F = 2147483646, K = 20;
int n, m;
char arr[N][N], b[N][N];
int main(){
cin.tie(0); ios::sync_with_stdio(0);
cin >> n >> m;
for(int i = 0; i < n; i++) for(int j = 0; j < m; j++){
b[i][j] = '.';
}
for(int i = 0; i < n; i++) for(int j = 0; j < m; j++){
cin >> arr[i][j];
if(arr[i][j]=='#'){
b[i][j] = '#';
int x = min(i + 1, n - 1);
int y = min(j + 1, m - 1);
b[i][y] = '#';
b[x][j] = '#';
b[x][y] = '#';
}
}
for(int i = 0; i < n; i++) {for(int j = 0; j < m; j++) cout << b[i][j]; cout << '\n';}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |