优化这段代码,加上输入m和n
时间: 2024-02-27 18:58:51 浏览: 21
好的,以下是优化后的代码,加上了输入m和n的部分:
```python
def is_prime(num):
"""判断一个数是否为素数"""
if num < 2:
return False
for i in range(2, int(num**0.5)+1):
if num % i == 0:
return False
return True
def prime_tuple(m, n):
"""生成[m,n]上的所有素数组成的元组"""
prime_list = [num for num in range(m, n+1) if is_prime(num)]
return tuple(prime_list)
def max_min_count_primes(prime_tuple):
"""求出元组中的最大素数、最小素数和素数的个数"""
max_prime = max(prime_tuple)
min_prime = min(prime_tuple)
count_primes = len(prime_tuple)
return max_prime, min_prime, count_primes
m = int(input("请输入m:"))
n = int(input("请输入n:"))
prime_tuple = prime_tuple(m, n)
max_prime, min_prime, count_primes = max_min_count_primes(prime_tuple)
print(f"在[{m},{n}]上的素数有:{prime_tuple}")
print(f"最大素数是:{max_prime}")
print(f"最小素数是:{min_prime}")
print(f"素数的个数是:{count_primes}")
```
运行时,程序会要求输入m和n:
```
请输入m:10
请输入n:50
在[10,50]上的素数有:(11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47)
最大素数是:47
最小素数是:11
素数的个数是:11
```
相关推荐
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![ppt](https://img-home.csdnimg.cn/images/20210720083527.png)
![doc](https://img-home.csdnimg.cn/images/20210720083327.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![docx](https://img-home.csdnimg.cn/images/20210720083331.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![whl](https://img-home.csdnimg.cn/images/20210720083646.png)