/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Accepted 1ms 532.0 KiB
#5 Accepted 4ms 536.0 KiB
#6 Accepted 4ms 532.0 KiB

Code

#include<bits/stdc++.h>
#define ll long long
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define testing cout << "testing ";
#define mod 1000000007
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;

void do_the_honour() {
    ll H, W;
    cin >> H >> W;

    if (H > W) swap(H, W);

    ll total_subgrids = 0;

    for (ll k = 1; k <= H; ++k) {
        total_subgrids += (H - k + 1) * (W - k + 1);
    }

    cout << total_subgrids << endl;
}

int main() {
    optimize();
    int t = 1;
    //cin >> t;
    for(int z = 1; z <= t; z++) {
        do_the_honour();
    }
    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 14:34:11
Judged At
2024-11-05 14:34:11
Judged By
Score
100
Total Time
4ms
Peak Memory
536.0 KiB