oj.uz

Submission #1104255

# Submission time Handle Problem Language Result Execution time Memory
1104255 2024-10-23T10:51:40 Z ALTAKEXE Robots (APIO13_robots) C++17
0 / 100
 1 ms 592 KB 
#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;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 592 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 592 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 592 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 592 KB Output isn't correct
2 Halted 0 ms 0 KB -