寒假集训_专题四题解_E - Revenge of GCD

题目

In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), highest common factor (hcf), or greatest common measure (gcm), of two or more integers (when at least one of them is not zero), is the largest positive integer that divides the numbers without a remainder.
—Wikipedia

Today, GCD takes revenge on you. You have to figure out the k-th GCD of X and Y.
Input
The first line contains a single integer T, indicating the number of test cases.

Each test case only contains three integers X, Y and K.

[Technical Specification]

1. 1 <= T <= 100
2. 1 <= X, Y, K <= 1 000 000 000 000
   Output
   For each test case, output the k-th GCD of X and Y. If no such integer exists, output -1.
   Sample Input
   3
   2 3 1
   2 3 2
   8 16 3
   Sample Output
   1
   -1
   2

题目大意

求x、y最大公因数的第k大因子

题解

最大公因数可用gcd求，因为因子是成对出现的(t与x/t)，求出之后遍历1~sqrt(gcd(x,y)),另一半用x除以得到的数。

代码

#include <iostream> 
#include <cmath>
using namespace std;
typedef long long LL;
const int N = 1e6+ 10;
LL ans[N],cnt;
LL gcd(LL a, LL b)
{
	if(a == b||b == 0)return a;
	return gcd(b,a%b);
}
int main()
{
	int t;
	cin >> t;
	while(t--)
	{
		LL a,b,k;
		cin >> a >> b >> k;
		LL x = gcd(a,b);
		cnt = 0;
		int t = sqrt(x);
		for(int i = 1; i <= t; i ++)
			if(x % i == 0)ans[++cnt] = i;
		int len = cnt;
		if(t*t == x)len--;
		if(k > len + cnt)printf("-1\n");
		else if(k <= len)printf("%lld\n",x/ans[k]);
		else printf("%lld\n",ans[len+cnt-k+1]);
	}
	return 0;
}