素数集合DFS

def solve(____):
    def is_prime(____):
        if x < ____:
            return False
        for i in range(____, int(____) + ____):
            if x % i == ____:
                return False
        return True
    primes = [i for i in range(____, n + ____) if is_prime(____)]
    print(len(____))