如何求一个数组中两个素数的最大乘积？

import math

def is_prime(num):
    if num < 2:
        return False
    for i in range(2, int(math.sqrt(num)) + 1):
        if num % i == 0:
            return False
    return True

def max_prime_product(arr):
    primes = []
    for num in arr:
        if is_prime(num):
            primes.append(num)
    
    max_product = 0
    for i in range(len(primes)):
        for j in range(i+1, len(primes)):
            product = primes[i] * primes[j]
            if product > max_product:
                max_product = product
    
    return max_product

# 示例用法
arr = [2, 3, 4, 5, 6, 7, 8, 9, 10]
result = max_prime_product(arr)
print(result)  # 输出：35