Leaderboard
Showing:
Handle Score
@Ibrahim Nash 6420
@blackshadows 6380
@mb1973 5646
@Quandray 5233
@akhayrutdinov 5111
@saiujwal13083 4716
@sanjay05 3762
@kirtidee18 3673
@marius_valentin_dragoi 3522
@sushant_a 3459
@verma_ji 3413
Complete Leaderboard
Break Numbers[Duplicate problem]
Easy Accuracy: 77.96% Submissions: 59 Points: 2

Given a large number N, write a program to count the ways to break it into three whole numbers such that they sum up to the original number.

Example 1:

Input: N = 3
Output: 10
Explaination: The ways are 
0 + 0 + 3 = 3
0 + 3 + 0 = 3
3 + 0 + 0 = 3
0 + 1 + 2 = 3
0 + 2 + 1 = 3
1 + 0 + 2 = 3
1 + 2 + 0 = 3
2 + 0 + 1 = 3
2 + 1 + 0 = 3
1 + 1 + 1 = 3

Example 2:

Input: N = 1
Output: 3
Explaination: The ways are:
1 + 0 + 0 = 3
0 + 1 + 0 = 3
0 + 0 + 1 = 3

Your Task:
You do not need to read input or print anything. Your task is to complete the function countWays() which takes N as input parameter and returns the total number of possible ways to break N in three whole numbers.

Expected Time Complexity: O(1)
Expected Auxiliary Space: O(1)

Constraints:
1 ≤ N ≤ 109  

to report an issue on this page.

Editorial

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

Yes

All Submissions

My Submissions:

Login to access your submissions.

Break Numbers[Duplicate problem]

Output Window