You are given two integers n and k. Find k-th smallest divisor of n, or report that it doesn't exist.
Divisor of n is any such natural number, that n can be divided by it without remainder.
Input
The first line contains two integers n and k (1 ≤ n ≤ 1015, 1 ≤ k ≤ 109).
Output
If n has less than k divisors, output -1.
Otherwise, output the k-th smallest divisor of n.
Examples
input
4 2
output
2
input
5 3
output
-1
input
12 5
output
6
Note
In the first example, number 4 has three divisors: 1, 2 and 4. The second one is 2.
In the second example, number 5 has only two divisors: 1 and 5. The third divisor doesn't exist, so the answer is -1.
思路:
将n的因子用sqrt分成两份。水过。
代码:
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long LL;
int a[100000];
int main()
{
LL n,m,sum=0,l=0;
cin>>n>>m;
if(n<m)
{
cout<<"-1"<<endl;
return 0;
}
int s=(int)sqrt(n);
int flag=0;
for(int i=1; i<=s; i++)
{
if(n%i==0)
{
a[++l]=i;
if(l==m)
{
flag=1;
break;
}
}
}
if(flag)
{
cout<<a[l]<<endl;
return 0;
}
int tmp=l;
LL p;
for(int i=l; i>=1; i--)
{
p=n/a[i];
if(p!=a[l])
++tmp;
if(tmp==m)
{
flag=1;
break;
}
}
if(flag)
cout<<p<<endl;
else
cout<<"-1"<<endl;
}