素数判断

def solve():
    def is_prime(n):
        if n < 2:
            return False
        for i in range(2, int(n**0.5)+1):
            if n % i == 0:
                return False
        return True
    primes = [n for n in range(2, 100) if is_prime(n)]
    print(f"100以内的素数({len(primes)}个):")
    print(primes)