题解 | #质数因子#
质数因子
http://www.nowcoder.com/practice/196534628ca6490ebce2e336b47b3607
import sys from math import sqrt #判断是否质数 def is_prime(n): if n == 1: return False #n不可能存在两个比n开方大的质因子 for i in range(2, int(sqrt(n) + 1)): if n % i == 0: return False return True while True: try: d = int(input()) if is_prime(d): print(d, end = " ") else: #把质数从小到大判断是否能整除 i = 2 while d > 1 and i < int(d / 2) + 1: if d % i != 0: i += 1 else: print(i, end = " ") d //= i if is_prime(d): print(d, end = " ") break # print(get_zhi_shu()) except: # print(sys.exc_info()) break # import sys # import math # #判断是否质数 # def check_zhi_shu(num): # zhishu = True # l = int(math.sqrt(num)) + 1 # for j in range(2, l): # if num % j == 0: # return False # return True # # #获得质数 # # def get_zhi_shu(): # # z = [] # # for i in range(2, 1000): # # if check_zhi_shu(i): # # z.append(i) # # return z # # z = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997] # # z = get_zhi_shu() # while True: # try: # d = int(input()) # if check_zhi_shu(d): # print(d, end = " ") # else: # #把质数从小到大判断是否能整除 # i = 2 # while d > 1 and i < int(d / 2) + 1: # if d % i != 0: # i += 1 # else: # print(i, end = " ") # d //= i # if check_zhi_shu(d): # print(d, end = " ") # break # # print(get_zhi_shu()) # except: # # print(sys.exc_info()) # break