Please enter your email address or userHandle.
Given a positive integer N, count the number of possible ways to represent N as sum of four positive integers.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow.
The first line of each test case contains a positve integer N.
Print out the number of ways to divide N in four parts.
1 <= T <= 100
0 <= N <= 300
Output 1: There is only one way to divide 5 (1, 1, 1, 2)
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.