13
msibirov1975
1 5 13
778/ 845
Михаил Сибирев
Last seen 14 days ago
Member for 8 months, 1 day
Difficulty Easy
def greatest_common_divisor(*args: int) -> int: def gcd(a,b): if b == 0:
def reveal_num(line: str) -> int | float | None: result ="" for char in line
def most_efficient_cutting(bom): bom.sort() rem = 6000 for length i
Created a forum post "не работает:(."
from collections.abc import Iterable def frequency_sorting(numbers: list[int])
Already decided :) Of course "".join:)