Because of maintenance, it won't be possible to submit any solutions this evening.
The maintenance starts at 2014-12-19 19:00 GMT
(20:00 SPOJ time) and will last from 8 to 10 hours
OK, don't show this message any more
SPOJ Problem Set (classical)
1296. 4 values whose sum is 0
Problem code: SUMFOUR
The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) belongs to A x B x C x D are such that a + b + c + d = 0 . In the following, we assume that all lists have the same size n
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 .
Output should be printed on a single line.
-45 22 42 -16
-41 -27 56 30
-36 53 -37 77
-36 30 -75 -46
26 -38 -10 62
-32 -54 -6 45
|Added by:||Abhilash I|
Cube (Intel Pentium G860 3GHz)
|Languages:||All except: ERL JS NODEJS PERL 6 |
|Resource:||South western 05-06|