/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 328.0 KiB
#2 Accepted 2ms 368.0 KiB
#3 Accepted 2ms 332.0 KiB
#4 Accepted 2ms 328.0 KiB
#5 Accepted 2ms 332.0 KiB
#6 Accepted 2ms 524.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;


#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define int long long
const int mod = 1e9 + 7, INF = 1e18 + 3, N = 2e5 + 2;


void solve(int cs){
    int h, w; cin >> h >> w;
    int ans = 0;
    for(int i = 1 ; i <= min(h, w) ; i++){
         ans += (h - i + 1) * (w - i + 1);
    }
    cout<<ans<<'\n';
}

//It's now, or never.
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int TEST = 1;
   // cin >> TEST;

    for (int i = 1; i <= TEST; i++) {
      //  cout << "Case " << i << ":"<<'\n';
        solve(i);
    }

    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:37:05
Judged At
2024-11-05 14:37:05
Judged By
Score
100
Total Time
2ms
Peak Memory
524.0 KiB