Created by lorem-ipsum-42
Created on October 11, 2021
291 Bytes
def div1(n: int) -> list: return [i for i in range(1, n + 1) if not n % i] def div2(n: int) -> list: liste_diviseur_n, i = [], 1 while not i == n + 1: if n % i == 0: liste_diviseur_n.append(i) i += 1 return liste_diviseur_n