Consecutive Sum (Financial Engineer Intern)

Problem Overview

• Task: Given a long integer num, determine how many ways it can be written as the sum of two or more consecutive positive integers.
• Input/Output: Input is num (1 ≤ num ≤ 10^12); return an integer count of such representations.
• Context: Models counting consecutive sum decompositions, relevant to number theory and sequence analysis in finance-related scenarios.
• Source: Bloomberg coding interview problem; a common interview question for Financial Engineer Intern roles.