POJ 2429 GCD & LCM Inverse(素数判定Miller-Rabin+素因子分解Pollard-rho)
Description给出gcd(a,b)和lcm(a,b),求a和b,如果存在多组方案则输出a+b最小的那一组Input两个整数gcd(a,b)和lcm(a,b),数值均不超过2^63,保证有解Output输出满足条件的a和b(a#include#include#include#include#include#include#includeusingnamespacestd;#definemax