测试评估
| 指标 | 结果 |
|---|---|
| Base 测试 | PASS |
| Plus 测试 | PASS |
| 代码长度 | 601 字符 |
模型生成的代码 (601 字符)
import math
def prime_num(n: int) -> bool:
"""
Return True if n is a prime number, False otherwise.
A prime number is a natural number greater than 1 that has no positive
divisors other than 1 and itself.
"""
# Handle numbers less than 2 (not prime)
if n < 2:
return False
# 2 is prime
if n == 2:
return True
# Even numbers greater than 2 are not prime
if n % 2 == 0:
return False
# Check odd divisors up to sqrt(n)
for i in range(3, math.isqrt(n) + 1, 2):
if n % i == 0:
return False
return True
Base 失败测试用例
- 无失败测试
Plus 失败测试用例
- 无失败测试