829. Consecutive Numbers Sum (Hard) - TengnanYao/daily_leetcode GitHub Wiki

class Solution:
    def consecutiveNumbersSum(self, n: int) -> int:
        k, result = 1, 0
        while k * (k - 1) // 2 < n:
            if (n - k * (k - 1) // 2) % k == 0:
                result += 1
            k += 1
        return result