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>
#define ll long long
#define ff first
#define ss second
#define inf INT_MAX
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FAR(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x.begin(), x.end())
const int N = 5e2 + 5;
const int MOD = 1e9 + 7;
using namespace std;
int main()
{
int n, w, h, cnt = 0;
cin >> n >> w >> h;
char c[N][N];
FOR(i, 0, h)
{
FOR(j, 0, w)
{
cin >> c[i][j];
cnt += (c[i][j] == 'A' || c[i][j] == 'C');
}
}
cout << cnt << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |