酷代码 AI
菜单
服务商

Python 实现:输入整数求质数相关结果,含样例与代码解析

```python def is_prime(num): if num < 2: return False if num == 2: return True if num % 2 == 0: return False for i in range(3, int(num0.5) + 1, 2): if num % i == 0: return False return True def find_nearest_primes(n): lower = n - 1 while lower >= 2 and not is_prime(lower): lower -= 1 if lower < 2: lower = None upper = n + 1 while upper <= 1299709 and not is_prime(upper): upper += 1 if upper > 1299709: upper = None return lower, upper def main(): n = int(input().strip()) if is_prime(n): print(0) else: lower_prime, upper_prime = find_nearest_primes(n) if lower_prime is not None and upper_prime is not None: print(upper_prime - lower_prime) if __name__ == "__main__": main() ``` ######[AI问答 | 254点数解答 | 2026-01-11 17:37:06]

相关提问
本站限时免费提问中
实用工具查看更多
Linux在线手册 [开发类]
Jquery在线手册 [开发类]
今日油价 [生活类]
图片互转base64 [开发类]
时间转换器 [开发类]