Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6380 |

@mb1973 | 5642 |

@Quandray | 5233 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4610 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3413 |

Complete Leaderboard | |

Handle | Score |

@sanskar94511 | 603 |

@akashverma4 | 363 |

@swastik8750 | 300 |

@nishunishuraj18 | 286 |

@surajmamgai | 264 |

@anks9013 | 222 |

@nayan2709 | 213 |

@burhanuddinbohra72 | 212 |

@realname | 203 |

@amank8975 | 203 |

@manmeetkaur18102000 | 202 |

Complete Leaderboard |

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.

**Example 1:**

Input:N =10Output:1Explanation:10 can be reprsented as sum of two or more consecutive numbers in only one way. 10 = 1+2+3+4.

**Example 2:**

Input:N =15Output:3Explanation: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).

**Your Task:**

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)

**Constraints:**

1 <= N <= 10^{8}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Count of sum of consecutives

...