Accepted
Code
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int H, W;
cin >> H >> W;
int max_side = min(H, W);
long long total_squares = 0;
for (int k = 1; k <= max_side; ++k) {
long long possible_rows = H - k + 1;
long long possible_cols = W - k + 1;
total_squares += possible_rows * possible_cols;
}
cout << total_squares << endl;
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1121 Square Counting Challenge
- Contest
- Brain Booster #7
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2024-11-05 15:17:57
- Judged At
- 2024-11-05 15:17:57
- Judged By
- Score
- 100
- Total Time
- 1ms
- Peak Memory
- 532.0 KiB