/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 1ms 540.0 KiB
#3 Accepted 1ms 328.0 KiB
#4 Accepted 2ms 492.0 KiB
#5 Accepted 1ms 540.0 KiB
#6 Accepted 1ms 540.0 KiB

Code


//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define Endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; for(int i=1;i<=t;i++)
const int N = 1e6 + 7;
using namespace std;
void s()
{
    int n,m;
    cin>>n>>m;

    int  x=max(n,m);
    int  xx=min(n,m);
    int cnt=0;
    int f=1;
    cnt+=n*m;

    while(m>0 && n>0)
    {
        n--;
        m--;
        cnt+=n*m;
    }
    cout<<cnt<<endl;

}



int32_t main()
{
    ios::sync_with_stdio(false);
    //faster
    //TC
    {
        //cout<<"Case "<<i<<": ";
        s();

    }



}





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