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 fi first
#define se second
#define ve vector
#define all(x) x.begin(), x.end()
using namespace std;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#pragma GCC optimize("O3")
signed main(){
int n, m;
cin >> n >> m;
ve<string> v(n);
for(auto& i : v)
cin >> i;
int res = 0;
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
for(int k = i + 1; k < n; k++)
for(int l = j + 1; l < m; l++)
res += v[i][j] == 'J' && v[i][l] == 'O' && v[k][j] == 'I';
cout << res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |