# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
934327 | Khasar | Bold (COCI21_bold) | C++14 | 1 ms | 348 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;
int main() {
cin >> n >> m;
char c;
vector<vector<char> > a(n+2, vector<char> (m,'.'));
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin >> c;
if(c=='#'){
a[i][j]='#';
a[i+1][j]='#';
a[i][j+1]='#';
a[i+1][j+1]='#';
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cout << a[i][j];
}
cout << endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |