Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
65813 | jdf_chenjialin | 202503gesp四级02 | C++ | No Test Data | 0 MS | 0 KB | 683 | 2025-05-29 17:03:43 |
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n >> m; vector<vector<int>> A(n, vector<int>(m)); for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { cin >> A[i][j]; } } int count = 0; for (int i = 0; i < n - 1; ++i) { for (int j = 0; j < m - 1; ++j) { int D11 = A[i][j]; int D12 = A[i][j + 1]; int D21 = A[i + 1][j]; int D22 = A[i + 1][j + 1]; if (D11 * D22 == D12 * D21) { count++; } } } cout << count << endl; return 0; }