# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
421004 | Chaska | Bold (COCI21_bold) | C++11 | 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;
int n,m;
char a[105][105],b[105][105];
int main()
{
cin >> n >> m;
for (int i=0;i<n;i++) for (int j=0;j<m;j++) cin >> a[i][j];
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++) if (a[i][j]=='#') {
b[i][j] = '#';
if (j<m-1) b[i][j+1] = '#';
if (i<n-1) b[i+1][j] = '#';
if (i<n-1 && j<m-1) b[i+1][j+1] = '#';
}
for (int i=0;i<n;i++) {
for (int j=0;j<m;j++) cout << b[i][j];
cout << "\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |