Codeforces 1360D - Buying Shovels Solution



Solution in C++: 

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

///AH Tonmoy

///Department of CSE,23rd batch

    ///Islamic University,Bangladesh


    #include <bits/stdc++.h>
    using namespace std;
    int main()
    {
        int t,n,i,k,r;
        cin>>t;
        while(t--)
        {
            vector<int>v;
            cin>>n>>k;
            r=n;
            for(i=1; i<=sqrt(n); i++)
            {
                if(n%i==0)
                {
                    if(i<=k)
                    r=min(r,n/i);
                    if(n/i<=k)
                    r=min(r,i);
                }
            }
             cout<<r<<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.