测试评估
| 指标 | 结果 |
|---|---|
| Base 测试 | PASS |
| Plus 测试 | PASS |
| 代码长度 | 399 字符 |
模型生成的代码 （399 字符）
def divisor(n):
"""
Returns the number of divisors of a given positive integer n.
"""
if n <= 0:
return 0 # or raise ValueError, based on requirements
count = 0
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
count += 1 # i is a divisor
if i != n // i:
count += 1 # n // i is a distinct divisor
return countBase 失败测试用例
- 无失败测试
Plus 失败测试用例
- 无失败测试