# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
483874 |
2021-11-01T07:01:55 Z |
Sohsoh84 |
Bold (COCI21_bold) |
C++17 |
|
1 ms |
344 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sep ' '
#define endl '\n'
#define debug(x) cerr << #x << ": " << x << endl;
const ll MAXN = 1e2 + 10;
const ll INF = 8e18;
const ll MOD = 1e9 + 7; // 998244353;
char ans[MAXN][MAXN];
int n, m;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
char c;
cin >> c;
if (c == '#') ans[i][j] = '#', ans[i + 1][j] = '#', ans[i][j + 1] = '#', ans[i + 1][j + 1] = '#';
if (ans[i][j] == '#') cout << '#';
else cout << '.';
}
cout << endl;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |