Leaderboard
Showing:
Handle Score
@Ibrahim Nash 6420
@blackshadows 6380
@mb1973 5704
@Quandray 5245
@akhayrutdinov 5111
@saiujwal13083 5046
@sanjay05 3762
@kirtidee18 3673
@marius_valentin_dragoi 3523
@mantu_singh 3510
@sushant_a 3459
Complete Leaderboard
Divide the number
Basic Accuracy: 63.75% Submissions: 442 Points: 1

Given a positive integer N, count the number of possible ways to represent N as the sum of four positive integers.
 

Example 1:

Input:
N = 5
Output:
1
Explanation:
We can represent 5 as
a sum of 4 positive integers,
only in 1 way as 1+1+1+2 = 5

Example 2:

Input:
N = 41
Output:
511
Explanation:
We can represent 41 as
sum of 4 positive integers
in 511 ways


Your Task:
You don't need to read input or print anything. Your task is to complete the function countWays() which takes an integer N as input parameter and returns an integer, the total count of the number of ways N can be represented as sum of 4 positive numbers.

 

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

 

Constraints:
0 <= N <= 100

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.

Divide the number

Output Window