Educational Codeforces Round 17 762A. k-th divisor Solution

 

Problem Link: https://codeforces.com/problemset/problem/762/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;

int main()

{

    long long n,k,i;

    while(cin>>n>>k)

    {

        vector<long long>v;

        for(i=1; i*i<=n; i++)

        {

            if(n%i==0)

            {

                v.push_back(i);

                if(i*i!=n)

                    v.push_back(n/i);

            }

        }

        sort(v.begin(),v.end());

        if(v.size()>=k)

            cout<<v[k-1]<<endl;

        else

            cout<<"-1"<<endl;

    }

}