/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 324.0 KiB
#3 Accepted 1ms 320.0 KiB
#4 Accepted 1ms 324.0 KiB
#5 Accepted 1ms 508.0 KiB
#6 Accepted 1ms 324.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD 1000000007
#define test int t;cin>>t;while(t--)
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define F first
#define S second
#define yes cout<<"YES"<<'\n';
#define no cout<<"NO"<<'\n';
#define endl "\n"
#define all(v) v.begin(),v.end()
#define print(v) for(auto it:v) cout<<it<<" "; cout<<endl;
#define print2(pr) for(int i=pr.size()-1;i>=0;i--)cout<<pr[i];cout<<endl;
#define srt(v) sort(v.begin(),v.end());
#define rsrt(v) sort(v.rbegin(),v.rend());
#define rvs(v) reverse(v.begin(),v.end());
#define cinv(v) for(auto &it:v)cin>>it;
#define rall(v) v.rbegin(),v.rend()
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define PI 2*acos(0.0)
#define pr pair<int,int>
#define Tasrik ios_base::sync_with_stdio(0);  cin.tie(0); cout.tie(0);

void abrakadabra()
{
    ll n,m;
    cin>>n>>m;

    ll ans=0;
    for(int i=0; i<min(n,m); i++)
    {
        ans+=(m-i)*(n-i);
    }

    cout<<ans<<endl;

}

int main ()
{
    Tasrik;
    int cs=1;
   // test
    {
//        cout << "Case " <<cs << ": ";
//        cs++;
        abrakadabra();
    }

    return 0;
}


Information

Submit By
Type
Submission
Problem
P1121 Square Counting Challenge
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-07 18:52:48
Judged At
2024-11-11 02:23:03
Judged By
Score
100
Total Time
1ms
Peak Memory
532.0 KiB