测试评估
| 指标 | 结果 |
|---|---|
| Base 测试 | PASS |
| Plus 测试 | PASS |
| 代码长度 | 583 字符 |
模型生成的代码 （583 字符）
def is_not_prime(n: int) -> bool:
"""
Determine if a given integer is NOT a prime number.
Args:
n: Integer to check.
Returns:
True if n is not prime, False if n is prime.
"""
# Numbers less than 2 are not prime
if n < 2:
return True
# 2 is the only even prime
if n == 2:
return False
# Any other even number is not prime
if n % 2 == 0:
return True
# Check odd divisors up to sqrt(n)
i = 3
while i * i <= n:
if n % i == 0:
return True
i += 2
return FalseBase 失败测试用例
- 无失败测试
Plus 失败测试用例
- 无失败测试