# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520005 | KoD | Emacs (COCI20_emacs) | C++17 | 1 ms | 332 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 std::vector;
using std::array;
using std::pair;
using std::tuple;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int N, M;
std::cin >> N >> M;
vector grid(N + 1, vector(M + 1, '.'));
int ans = 0;
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= M; ++j) {
std::cin >> grid[i][j];
if (grid[i][j] == '*' and grid[i - 1][j] == '.' and grid[i][j - 1] == '.') {
ans += 1;
}
}
}
std::cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |