hdu 5019 Revenge of GCD

求2个数第K大公约数，简单数学

#include<iostream>
#include<algorithm>
#include<cmath>
#define maxn 1000010
#define ll long long
using namespace std;
ll a,b,k;
ll sum[maxn];
ll gcd(ll a,ll b)
{
	if(b==0) return a;
	return gcd(b,a%b);
}
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		cin>>a>>b>>k;
		if(a<b) swap(a,b);
		ll re=gcd(a,b);
		int p=0;
		for(ll i=1;i*i<=re;i++)
		{
			if(re%i==0)
			{
				sum[p++]=i;
				if(i*i!=re) sum[p++]=re/i;
			}
		}
		sort(sum,sum+p);
		if(p-k<0) cout<<-1<<endl;
		else cout<<sum[p-k]<<endl;
	}
	return 0;
}