# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
523330 | tato | Bold (COCI21_bold) | C++14 | 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;
char a[500][500],b[500][500];
void answer()
{
int n,m;
cin >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
{
cin >> a[i][j];
if(a[i][j] == '#')
{
b[i][j] = '#';
b[i][j + 1] = '#';
b[i + 1][j] = '#';
b[i + 1][j + 1] = '#';
}
else
if(b[i][j] != '#')
b[i][j] = '.';
}
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
cout << b[i][j] ;
cout << '\n';
}
}
int main()
{
int t = 1;
//cin >> t;
while(t--)
answer();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |