Scribd
Upload
41 views3 pages

Powered by HackerRank11

The document describes a coding challenge to write a function that takes a long integer as input and returns the number of ways to represent that integer as the sum of two or more consecutive positive integers. It provides two sample inputs and outputs to demonstrate examples where the number is 15 and 10. The goal is to complete the code in the editor to solve this problem.

Uploaded by

Gamindu Udayanga
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views3 pages

Powered by HackerRank11

The document describes a coding challenge to write a function that takes a long integer as input and returns the number of ways to represent that integer as the sum of two or more consecutive positive integers. It provides two sample inputs and outputs to demonstrate examples where the number is 15 and 10. The goal is to complete the code in the editor to solve this problem.

Uploaded by

Gamindu Udayanga
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

10/12/2017 Open House - Sep 2017 :: powered by HackerRank

 
 01h : 06m : 08s
Open House - Sep 2017
to test end

 Consecutive Sum

Given a long integer, num, find the number of ways to represent it as a sum of two or more
consecutive positive integers. For example:

 
 If num = 15, then there are three such ways: (1 + 2 + 3 + 4 + 5) = (4 + 5 + 6) = (7 + 8) =
15.
If num = 2, then there are zero such ways.
- Analytical &
 
Problem
Solving -
Complete the consecutive function in the editor below. It has one parameter: a long integer
named num. The function must return an integer denoting the number of ways to represent
1 num as a sum of two or more consecutive positive integers.
 
2 Input Format
- Computer Locked stub code in the editor reads a long integer denoting num from stdin and passes it to
Science - the function.
 
3
Constraints
1 ≤ num ≤ 1012
4  
Output Format
5 Return an integer denoting the number of ways to represent num as a sum of two or more
consecutive positive integers.
6  
Sample Input 0
7
15
8
 
9 Sample Output 0

10 3

11  
Explanation 0
12 There are three ways to calculate num = 15 as a sum of two or more consecutive integers:
 
1. 1 + 2 + 3 + 4 + 5 = 15
2. 4 + 5 + 6 = 15

https://www.hackerrank.com/tests/3ssolj6h95g/questions/5bj2mblem1p 1/3
10/12/2017 Open House - Sep 2017 :: powered by HackerRank

3. 7 + 8 =15  
 01h : 06m : 08s
Open
  House - Sep 2017 to test end
Thus, the function returns 3.
 
Sample Input 1

10

 
Sample Output 1

 
Explanation 1
There is one way to calculate num = 10 as a sum of two or more consecutive integers:
 
1. 1 + 2 + 3 + 4 =10
 
Thus, the function returns 1.
 

YOUR ANSWER

We recommend you take a quick tour of our editor before you proceed. The timer ✖
will pause up to 90 seconds for the tour.   Start tour

Original code C++  ⚙

1 ▸ #include ↔
2
3 using namespace std;
4
5
6▾ /*
7 * Complete the function below.
8 */
9▾ int consecutive(long num) {
10
11 }
12

https://www.hackerrank.com/tests/3ssolj6h95g/questions/5bj2mblem1p 2/3
10/12/2017 Open House - Sep 2017 :: powered by HackerRank

 
 01h : 06m : 08s
Open House - Sep 2017
to test end

13 int main()
14 ▾ {
15 ofstream fout(getenv("OUTPUT_PATH"));
16
17 int res;
18 long num;
19 cin >> num;
20 cin.ignore(numeric_limits<streamsize>::max(), '\n');
21
22 res = consecutive(num);
23 fout << res << endl;
24
25 fout.close();
26 return 0;
27 }
28

Line: 10 Col: 1

Test against custom input Run Code Submit code & Continue

(You can submit any number of times)

 Download sample test cases The input/output files have Unix line endings. Do not use Notepad to
edit them on windows.

About Privacy Policy Terms of Service

https://www.hackerrank.com/tests/3ssolj6h95g/questions/5bj2mblem1p 3/3

You might also like