Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 6564 |

@blackshadows | 6400 |

@mb1973 | 5785 |

@Quandray | 5275 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4639 |

@sanjay05 | 3762 |

@mantu_singh | 3712 |

@gfgaccount | 3627 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@yaswanthero123 | 625 |

@vikash619 | 611 |

@venkat11803610 | 501 |

@roshan13ar | 396 |

@DevangSingh | 379 |

@ravi11815721 | 312 |

@hrishipangavhane | 286 |

@aryanjain85297 | 280 |

@kommaraju11806903 | 277 |

@infosumitraut | 272 |

@ankitsharma5422 | 256 |

Complete Leaderboard |

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(N^{4})

**Expected Space Complexity:** O(1)

**Constraints:**

0 <= N <= 100

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?

YesLoading...

Divide the number

...