Accepted
Code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n';
bool comp(pair<int,int>a,pair<int,int>b){
if(a.first == b.first){
return a.second < b.second;
}
return a.first > b.first;
}
void tc(){
int t;
cin >> t;
while (t--){
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
//tc();
ll x,y;
cin >> x >> y;
ll mn = min(x,y);
ll i = 1;
ll ans = 0;
while (i <= mn){
ans += (x*y);
--x;
--y;
++i;
}
cout << ans << 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 14:49:16
- Judged At
- 2024-11-05 14:49:16
- Judged By
- Score
- 100
- Total Time
- 1ms
- Peak Memory
- 532.0 KiB