/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 2ms 556.0 KiB
#3 Accepted 1ms 332.0 KiB
#4 Accepted 1ms 504.0 KiB
#5 Accepted 1ms 492.0 KiB
#6 Accepted 1ms 556.0 KiB

Code

#include <iostream>
using namespace std;

long long countPerfectSquareSubgrids(int H, int W) {
    int minSide = min(H, W);
    long long totalCount = 0;

    for (int k = 1; k <= minSide; ++k) {
        long long countK = (H - k + 1) * (W - k + 1);
        totalCount += countK;
    }

    return totalCount;
}

int main() {
    int H, W;
    cin >> H >> W; 
    long long result = countPerfectSquareSubgrids(H, W);

    
    cout << result << endl;

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1121 Square Counting Challenge
Contest
Brain Booster #7
Language
C++11 (G++ 13.2.0)
Submit At
2024-11-05 14:55:45
Judged At
2024-11-05 14:55:45
Judged By
Score
100
Total Time
2ms
Peak Memory
556.0 KiB