题目链接:revenge of GCD
官方题解:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
using namespace std;
long long int ans[100010];
long long int gcd(long long int a,long long int b)
{
if(b == 0)
return a;
return gcd(b,a%b);
}
int main()
{
long long int a,b,c;
int t;
scanf("%d",&t);
while(t--)
{
memset(ans,0,sizeof(ans));
scanf("%lld%lld%lld",&a,&b,&c);
long long int k = gcd(a,b);
long long int p = 0;
for(long long int i=1;i*i<=k;i++){
if(k % i == 0)
{
ans[++p] = i;
if(i *i != k)
ans[++p] = k / i;
}
}
if(c > p)
puts("-1");
else {
sort(ans+1,ans+1+p);
printf("%lld\n",ans[p-c+1]);
}
}
return 0;
}