素数分解

import math
def isPrime(n):
    if n == 2:
        return True
    if n == 1:
        return False
    for i in range(3,int(math.sqrt(n)+1)):
        if n%i==0:
            return False
    return True




def Prime():
    n = 1
    while True:
        while True:
           n= n+1
           if isPrime(n)==True:
               break
        yield n



if __name__=="__main__":
    gen = Prime()

    s = input("输入x：")
    first = True
    x = int(s)
    while True:
        if x == 1:
            break
        Next = gen.__next__()
        while x%Next==0:
            x = x//Next
            if first:
                first = False
            else :
                print("*",end="")
            print(Next,end="")
"""

import random
x = [random.randint(0,100) for i in range(20)]
print(x)

x[:10]=sorted(x[:10])
x[10:20]=sorted(x[10:20],reverse=True)
print(x)       
          
 """