def is_prime(n):\n if n <= 1:\n return False\n for i in range(2, int(n**0.5) + 1):\n if n % i == 0:\n return False\n return True\n\ndef generate_prime_numbers(limit):\n prime_numbers = []\n for num in range(2, limit):\n if is_prime(num):\n prime_numbers.append(num)\n return prime_numbers\n\nlimit = int(input("Enter the limit: "))\nprime_numbers = generate_prime_numbers(limit)\nprint("Prime numbers up to", limit, "are:", prime_numbers)

Python 代码生成质数列表

原文地址: https://www.cveoy.top/t/topic/qpud 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录