题解

哈喽小伙伴们，今天我继续给大家分享题解！
话不多说，这道题懂的都懂，那么直接给大家上代码！

#include <iostream>
using namespace std;

int countSquare(int n, int m) {
    int count = 0;
    int minSide = min(n, m);

    for (int side = 1; side <= minSide; side++) {
        count += (n - side + 1) * (m - side + 1);
    }

    return count;
}

int main() {
    int n, m;
    cin >> n >> m;

    int result = countSquare(n, m);
    cout << result << endl;

    return 0;
}