Given four lists : A,B,C,D of Integer values, compute how many
quadruplets (a,b,c,d) (a is in A; b is in B; c is in C; d is in D) are such that
a+b+c+d=0 ?
The lists all have the same size n.
The input begins with a single positive integer on a line by itself indicating
the number of the cases following, each of them as described below. This line is
followed by a blank line, and there is also a blank line between two consecutive
inputs.
The first line of the input file contains the size of the lists n (this value can
be as large as 4000). We then have n lines containing four integer values (with
absolute value as large as 228 ) that belong respectively to A, B, C and D .
For each test case, the output must follow the description below. The
outputs of two consecutive cases will be separated by a blank line.
For each input file, your program has to write the number quadruplets
whose sum is zero.
Sample Explanation: Indeed, the sum of the five following quadruplets is
zero: (-45, -27, 42, 30), (26, 30, -10, -46), (-32, 22, 56, -46),(-32, 30, -75, 77),
(-32, -54, 56, 30).