Codeforces Round #816 (Div. 2) 1715A - Crossmarket Solution



 Problem Link: https://codeforces.com/contest/1715/problem/A

Solution in C++:

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll  n,t,i,j,f;
    cin>>t;
    while(t--)
    {
       ll m;
       cin>>n>>m;
       if(n==1&&m==1)
       cout<<"0"<<endl;
       else
       {
           if(m>n)
            swap(n,m);
           cout<<2*(m-1)+n<<endl;
       }
    }
}







No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.