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 <fstream>
#include <set>
#include <queue>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
ifstream cin("in.in");
ofstream cout("out.out");
char v[501][501];
set<vector<int>> sol;
int main() {
int n, m, ans = 0;
cin >> n >> m;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
cin >> v[i][j];
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (v[i][j] == 'J') {
for (int k = 1; k <= n; ++k) {
if (v[k][j] == 'I') {
for (int l = 1; l <= m; ++l) {
if (v[i][l] == 'O' && i < k && j < l) {
++ans;
}
}
}
}
}
}
}
cout << ans;
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... |