SUMFOUR  4 values whose sum is 0
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
Input
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 2^{28} ) that belong respectively to A, B, C and D .
(Edited: n <= 2500)
Output
Output should be printed on a single line.
Example
Input: 6 45 22 42 16 41 27 56 30 36 53 37 77 36 30 75 46 26 38 10 62 32 54 6 45 Output: 5
hide comments
syed_tanveer:
20190403 12:40:58
AC in first go using upper_bound() and lower_bound() 

Rahul Kathuria:
20190403 03:44:13
Easy peasy :P AC in 1st go!


divik544:
20190327 15:51:02
1. Do not remove duplicates.


y17prashant:
20190322 02:30:56
use vectors , array gave a RE.......fast io worked here .....Hint Complexity O(n^2*log(k))........Simple one Last edit: 20190322 02:33:16 

alphacoder101:
20190206 05:31:00
This is what happened for me:


masterchef2209:
20181017 22:57:20
unordered_map with reserve keyword got accepted


mayank_soni055:
20180929 22:51:02
Lots of optimization required:


ameyanator:
20180925 11:04:43
maps sets unordered maps nothing worked! had to write the binary search on my own!! 

abdo_allah1234:
20180904 01:45:45
how cani store integer values (with absolute value as large as 2^28 ) 

jmr99:
20180821 10:08:44
applied BS but getting WA on 9 again and again! 
Added by:  Abhilash I 
Date:  20070206 
Time limit:  1.419s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  South western 0506 