Codeforces Round #680 (Div. 2) C. Division

题目链接：https://codeforc.es/contest/1445/problem/C

Oleg’s favorite subjects are History and Math, and his favorite branch of mathematics is division.

To improve his division skills, Oleg came up with t pairs of integers pi and qi and for each pair decided to find the greatest integer xi, such that:

pi is divisible by xi;
xi is not divisible by qi.
Oleg is really good at division and managed to find all the answers quickly, how about you?
Input
The first line contains an integer t (1≤t≤50) — the number of pairs.

Each of the following t lines contains two integers pi and qi (1≤pi≤1018; 2≤qi≤109) — the i-th pair of integers.

Output
Print t integers: the i-th integer is the largest xi such that pi is divisible by xi, but xi is not divisible by qi.

One can show that there is always at least one value of xi satisfying the divisibility conditions for the given constraints.

Example

input

3
10 4
12 6
179 822

output

10
4
179

Note
For the first pair, where p1=10 and q1=4, the answer is x1=10, since it is the greatest divisor of 10 and 10 is not divisible by 4.

For the second pair, where p2=12 and q2=6, note that

12 is not a valid x2, since 12 is divisible by q2=6;
6 is not valid x2 as well: 6 is also divisible by q2=6.
The next available divisor of p2=12 is 4, which is the answer, since 4 is not divisible by 6.

---

题意

给定 pi qi ，求最大的 xi 使得 pi 能被 xi 整除，xi 不能被 qi 整除。

分析

我们可以遍历 q 的所有因子，然后从 q 中去掉这个因子（如果有的话），答案就在这些数中产生。
例如 q = a * a * a * b * b * c，p = a * b * b，那么 p 的因数有 a 和 b，我们在 q 中分别去掉 p 的因数 a 或者 b 以后就得到 b * b * c 和 a * a * a * c，答案就是这两个数中较大的一个。

代码

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll maxn = 100000;
int t;
ll p,q;

int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lld%lld",&p,&q);
		if(p % q != 0)
		{
			printf("%lld\n",p);
			continue;
		}
		ll i = 2, j, x;
		ll ans = 0;
		while(i * i <= q)
		{
			if(q%i==0)
			{
				x=p;
				while(x%q==0) x/=i;
				ans=max(ans,x);
				j=i;
				i=q/i;
				x=p;
				while(x%q==0)	x/=i;
				ans=max(ans,x);
				i=j;
			}
			i++;
		}
		i = q;
		x = p;
		while(x % q == 0) x /= i;
		ans = max(ans, x);
		printf("%lld\n",ans);
	}
	return 0;
}