Given a positive integer n, count the number of ways to represent n as the sum of four positive integers.In each representation: a + b + c + d = nwhere: a > 0, b > 0, c > 0, d > 0Return the total number of such representations.Examples:Input: n = 5Output: 1Explanation: The only
This is a summary. For the full story, refer to the original source. Public of India presents verified citizen-relevant reporting.