测试评估
| 指标 | 结果 |
|---|---|
| Base 测试 | PASS |
| Plus 测试 | PASS |
| 代码长度 | 406 字符 |
模型生成的代码 （406 字符）
def count_Primes_nums(n):
"""
Returns the number of prime numbers less than the given non-negative number n.
"""
if n <= 2:
return 0
# Sieve of Eratosthenes up to n-1
sieve = [True] * n
sieve[0] = sieve[1] = False
for i in range(2, int(n**0.5) + 1):
if sieve[i]:
for j in range(i * i, n, i):
sieve[j] = False
return sum(sieve)Base 失败测试用例
- 无失败测试
Plus 失败测试用例
- 无失败测试