Submission #1104255

#TimeUsernameProblemLanguageResultExecution timeMemory
1104255ALTAKEXERobots (APIO13_robots)C++17
0 / 100
1 ms592 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...