[Python]小蓝做题

import os
import sys
import math
# 请在此输入您的代码

t = int(input())
def prime_factor(num):# 分解质因数
    factors = []
    i = 2
    while i * i <= num:
        if num % i == 0:
            factors.append(i)
        else:
            i += 1
    if num > 1:# 判断最后剩下的部分是否需要加入
        factors.append(num)
    return factors
def lcm(x,n):#最小公倍数
  t = (x*n)/ math.gcd(x,n)
  return t

for i in range(t):
    n,num = map(int,input().split())
    #print(prime_factor(num))
    x = sum(prime_factor(n))
    if lcm(x,n) == num:
        print('YES')
    else:
        print('NO')

• 难点在于明确分解质因数的做法，lcm，gcd的求法；gcd可以通过math库实现
• lcm(a,b) =(a*b)/gcd(a,b)