Accepted
Code
#include <bits/stdc++.h>
using namespace std;
#define ZORO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int M = 3e5 + 5, MOD = 998244353;
int gcd(int a,int b)
{
while(b != 0)
{
int temp = a % b;
a = b;
b = temp;
}
return a;
}
void solve(){
int n,k;
cin>>n>>k;
int ans = 0;
for(int i=1; i<=min(n,k) ;i++){
ans += (n-i+1) * (k-i+1);
}
cout<<ans<<endl;
}
int32_t main()
{
ZORO
int tt;
// cin>>tt;
// while(tt--)
{
solve();
}
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 16:37:20
- Judged At
- 2024-11-05 16:37:20
- Judged By
- Score
- 100
- Total Time
- 1ms
- Peak Memory
- 536.0 KiB