素数在python中怎么表示_Python：将一个数表示为素数的和

我需要写一个算法，把一个数表示为素数的最小和：

例如：

8-&gt；[2，2，2]，[3，5]，[2，3，3]

我需要得到这个的最小长度=&gt；2

我已经编写了代码，但它需要很多时间，因为它包含递归。我如何改变它来提高时间？在import sys

x = int(sys.stdin.readline())

def is_prime(n):

for i in range(2, n):

if n % i == 0:

return False

return True

def decomposition(x):

result = []

for a in range(2, int(x/2 + 1)):

if x-a >= 2:

b = x - a

pair = [a, b]

result.append(pair)

return result

def f(elem):

list_of_mins = []

if is_prime(elem) == True:

return 1

else:

pairs = decomposition(elem)

print(pairs)

for a,b in pairs:

list_of_mins.append(f(a)+f(b))

return min(list_of_mins)

if str(int(x)).isdigit() and 2 <= int(x) <= 10 ** 9:

sum = []import sys

x = int(sys.stdin.readline())

def is_prime(n):

for i in range(2, n):

if n % i == 0:

return False

return True

def decomposition(x):

result = []

for a in range(2, int(x/2 + 1)):

if x-a >= 2:

b = x - a

pair = [a, b]

result.append(pair)

return result

def f(elem):

list_of_mins = []

if is_prime(elem) == True:

return 1

else:

pairs = decomposition(elem)

print(pairs)

for a,b in pairs:

list_of_mins.append(f(a)+f(b))

return min(list_of_mins)

if str(int(x)).isdigit() and 2 <= int(x) <= 10 ** 9:

sum = []

print(f(x))