# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
386864 | phathnv | Bold (COCI21_bold) | C++11 | 1 ms | 364 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 ll;
const int N = 107;
int m, n;
char a[N][N];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> m >> n;
for(int i = 1; i <= m; i++)
cin >> (a[i] + 1);
for(int i = m; i >= 1; i--)
for(int j = n; j >= 1; j--)
if (a[i][j] == '#')
a[i + 1][j] = a[i][j + 1] = a[i + 1][j + 1] = '#';
for(int i = 1; i <= m; i++){
for(int j = 1; j <= n; j++)
cout << a[i][j];
cout << '\n';
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |