# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
487609 | KazamaHoang | Bold (COCI21_bold) | C++14 | 1 ms | 344 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];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> m;
for (int i = 1; i <= n; ++ i)
for (int j = 1; j <= m; ++ j)
cin >> a[i][j];
for (int i = n - 1; i >= 1; -- i)
for (int j = m - 1; j >= 1; -- j)
if (a[i][j] == '#') {
a[i+1][j] = '#';
a[i+1][j+1] = '#';
a[i][j+1] = '#';
}
for (int i = 1; i <= n; ++ i)
for (int j = 1; j <= m; ++ j) {
cout << a[i][j];
if (j == m)
cout << "\n";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |