Python数字分类器开发疑问：如何避免for循环每次迭代时变量重置？

Hey there! Let's work through the issues in your prime number classifier step by step. Your core problem is easy to fix, and we'll also tweak the prime-checking logic to make it accurate.

1. Fix the Variable Initialization Issue #

The biggest problem is where you're initializing isnotprime—you put it inside the for loop, which means it gets reset to 0 every time the loop runs. To keep a running count, move that initialization outside the loop:

2. Correct the Prime-Checking Logic #

Your original logic for primes is off: a prime number is a number greater than 1 that has no divisors other than 1 and itself. Instead of checking if the remainder equals 1, we need to check if the remainder equals 0 (meaning the number is divisible by another value). We can also optimize the loop to only run up to the square root of the input number—any factor larger than that would have a corresponding factor smaller than the square root, so we don't need to check further.

Revised Full Code #

# 导入time模块以实现延迟效果
from time import sleep
import math  # 用于优化素数判断的平方根计算

# 奇偶性判断函数
def sorter(userin):
    if userin % 2 == 0: 
        sleep(0.5)
        print(f"{userin} is an even number")
        sleep(0.5)
    else:  # 非0余数直接判定为奇数，简化判断
        sleep(0.5)
        print(f"{userin} is an odd number")
        sleep(0.5)

def primesorter(userin):
    # 处理特殊情况：小于2的数都不是素数
    if userin <= 1:
        sleep(0.5)
        print(f"{userin} is not a prime number")
        sleep(0.5)
        return
    
    isnotprime = 0  # 移到循环外，只初始化一次
    # 优化循环范围：只检查到输入数的平方根
    for x in range(2, int(math.sqrt(userin)) + 1):
        if userin % x == 0:
            isnotprime += 1
            break  # 找到一个因数就可以提前退出循环，不用继续检查
    
    if isnotprime >= 1:
        sleep(0.5)
        print(f"{userin} is not a prime number")
        sleep(0.5)
    else:
        sleep(0.5)
        print(f"{userin} is a prime number")
        sleep(0.5)

# 请求用户输入
userin = int(input("Input a number to be categorized: "))
# 将用户输入传入预定义函数
sorter(userin)
primesorter(userin)

Key Changes Explained #

• Variable placement: isnotprime is initialized once outside the loop, so it retains its count across iterations.
• Special case handling: We explicitly check for numbers ≤1, since they can't be primes.
• Accurate prime logic: We check for divisibility (remainder 0) instead of remainder 1, which aligns with the definition of primes.
• Loop optimization: Cutting the loop off at the square root of the input number makes the function run faster, especially for large values. We also break early once a divisor is found.

内容的提问来源于stack exchange，提问作者Ir874