def fsandexp(n,pfs=[]): if n==1:return [] if isprime2(n):return [n] #p = sieve(int(n**.5)+1) for i in sieve(int(n**.5)+1): if n%i==0: n//=i pfs+=[i] #if n==1:return [i] return [i]+fsandexp(n,pfs)
def fs(n,pfs=[]): if isprime2(n):return [n] p = sieve(int(n**.5)+1) exp = 0 for i in p: if n%i==0: while n%i==0: n//=i pfs+=[i] if n==1:return [i] return [i]+fs(n,pfs)
def fsandexp(n, pfs=[]): if n == 1: return [] if isprime2(n): return [n] # p = sieve(int(n**.5)+1) for i in sieve(int(n ** 0.5) + 1): if n % i == 0: n //= i pfs += [i] # if n==1:return [i] return [i] + fsandexp(n, pfs)
def fs(n, pfs=[]): if isprime2(n): return [n] p = sieve(int(n ** 0.5) + 1) exp = 0 for i in p: if n % i == 0: while n % i == 0: n //= i pfs += [i] if n == 1: return [i] return [i] + fs(n, pfs)