Given a number N, find the number of ways to represent this number as a sum of 2 or more consecutive natural numbers.
Input :15 Output :3 15 can be represented as: 1+2+3+4+5 4+5+6 7+8 Input :10 Output :1 10 can only be represented as: 1+2+3+4
The idea is to represent N as a sequence of length L+1 as:
N = a + (a+1) + (a+2) + .. + (a+L)
=> N = (L+1)*a + (L*(L+1))/2
=> a = (N- L*(L+1)/2)/(L+1)
We substitute the values of L starting from 1 till L*(L+1)/2 < N
If we get 'a' as a natural number then the solution should be counted.
The Time complexity for this program is O(N^0.5), because of the condition in the for loop.
This article is contributed by Pranav Marathe. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Count ways to reach the n'th stair
- Longest Consecutive Subsequence
- Find subarray with given sum | Set 1 (Nonnegative Numbers)
- Calculate sum of all numbers present in a string
- Count the number of possible triangles
- Segregate Even and Odd numbers
- Count all possible paths from top left to bottom right of a mXn matrix
- Count Possible Decodings of a given Digit Sequence
- Count of distinct substrings of a string using Suffix Array
- Largest Sum Contiguous Subarray
- Find a pair with given sum in a Balanced BST
- Find the Missing Number
- Find the number of islands | Set 1 (Using DFS)
- VISA Interview Experience (On-Campus)