Given a number N, the task is find the number of ways to represent this number as a sum of 2 or more consecutive natural numbers.
N = 10
10 can be reprsented as sum of two or
more consecutive numbers in only one
way. 10 = 1+2+3+4.
N = 15
15 can be reprsented as sum of two or
more consecutive numbers in 3 ways.
(15 = 1+2+3+4+5); (15 = 4+5+6); (15 = 7+8).
You don't need to read input or print anything. Your task is to complete the function getCount() which takes an Integer n as input and returns the answer.
Expected Time Complexity: O(sqrt(N))
Expected Auxiliary Space: O(1)
1 <= N <= 108
We strongly recommend solving this problem on your own before viewing its editorial. Do you still
want to view the editorial?
Login to access your submissions.