14 lines
339 B
Python
14 lines
339 B
Python
# HumanEval/24
|
|
# Loki Mode Multi-Agent Solution
|
|
# Attempts: 1
|
|
# Passed: True
|
|
|
|
def largest_divisor(n: int) -> int:
|
|
""" For a given number n, find the largest number that divides n evenly, smaller than n
|
|
>>> largest_divisor(15)
|
|
5
|
|
"""
|
|
for i in range(n // 2, 0, -1):
|
|
if n % i == 0:
|
|
return i
|
|
return 1 |