Codeforces Round #776 (Div. 3) 1650B - DIV + MOD Solution

Problem Link:https://codeforces.com/problemset/problem/1650/B

 Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long n,t,i,x,mx1,mx2,mp,l,r,a;

    cin>>t;

    while(t--)

    {

        cin>>l>>r>>a;

        if(r==1)

            cout<<((r/a)+(r%a))<<endl;

        else

        {

            mp=r-(r%a)-1;

            if(mp>=l)

                x=mp;

            else

                x=r;

            mx1=(x/a)+(x%a);

            mx2=(r/a)+(r%a);

            cout<<max(mx1,mx2)<<endl;

        }

    }

}