该博客是一个关于数学练习的问题，挑战者需要找到使给定整数对满足特定除法规则的最大整数。对于每对整数(p, q)，目标是找到最大的x，使得p能被x整除，但x不能被q整除。题目提供了输入输出示例，并指出在给定约束下总能找到至少一个符合条件的x。"
103306038,8648286,Dockerfile 指令详解：打造 Docker Image,"['Linux', 'Docker']
https://codeforces.ml/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 tt pairs of integers pipi and qiqi and for each pair decided to find the greatest integer xixi, such that:
- pipi is divisible by xixi;
- xixi is not divisible by qiqi.
Oleg is really good at division and managed to find all the answers quickly, how about you?
Input
The first line contains an integer tt (1≤t≤501≤t≤50) — the number of pairs.
Each of the following tt lines contains two integers pipi and qiqi (1≤pi≤10181≤pi≤1018; 2≤qi≤1092≤qi≤109) — the ii-th pair of integers.
Output
Print tt integers: the ii-th integer is the largest xixi such that pipi is divisible by xixi, but xixi is not divisible by qiqi.
One can show th
最低0.47元/天 解锁文章
扫一扫
587
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
