A. k-th divisor

https://codeforc.es/problemset/problem/762/A 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e7+9;
const int maxm=1e6+9;


ll ans[maxn],cnt;
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    ll n,k;
    cin>>n>>k;
    for(ll i=1;i*i<=n;i++)
    {
        if(n%i==0) ans[++cnt]=i;
    }
    //for(int i=1;i<=cnt;i++) cout<<ans[i]<<" ";
    //cout<<endl;
    if(k<=cnt) cout<<ans[k]<<endl;
    else
    {
        ll si=cnt*2;
        ll f=0;
        if(ans[cnt]*ans[cnt]==n) si--;
        if(si<k) cout<<-1<<endl;
        else cout<<n/ans[cnt*2-k-f+1]<<endl;
    }

    return 0;
}