ABCDEF  ABCDEF
You are given a set S of integers between 30000 and 30000 (inclusive).
Find the total number of sextuples that satisfy:
Input
The first line contains integer N (1 ≤ N ≤ 100), the size of a set S.
Elements of S are given in the next N lines, one integer per line. Given numbers will be distinct.
Output
Output the total number of plausible sextuples.
Examples
Input: 1 1 Output: 1 
Input: 2 2 3 Output: 4 
Input: 2 1 1 Output: 24 
Input: 3 5 7 10 Output: 10 
hide comments
sharansh12:
20180607 10:33:25
my complexity is O(n^3*(log n)^2) how to reduce it? Last edit: 20180607 10:33:55 

techobist:
20180601 06:58:46
I didn't get how O(N^3 + hashing) > O(N^3*logN). Any help? 

vivek_dwivedi:
20180525 10:10:45
Can anyone help me to solve it faster . I got ac in 1 go but time was 2.38 sec . How even peoples have solved it in less than 0.1 sec . please help


ameyanator:
20180515 19:44:11
This question completely baffles me. First of all unordered_map works and map doesn't. why are you tagged #binarysearch then? Next unordered_multiset doesn't work but unordered_map does??!! why? 

egoista_:
20180510 17:39:00
Be careful about d != 0. 

rohitnarayan:
20180331 12:58:05
AC in 2nd go!! Used unordered_map and lower_bound,upper_bound! 

pithoriya:
20180218 08:16:08
use simple approach ......and dont think complex. Last edit: 20180218 08:17:42 

ramini1996:
20180204 11:48:40
Rearrange the given expression as [ (a*b)+c = d*(e+f) ]. Now, store possible values for LHS in a vector(say v1) and possible values for RHS in another vector(say v2). Now, sort v2 and iterate over elements of v1 and check how many elements in v2 are same as current element in v1. Now, add those many elements to the count. This can be easily accomplished by using equal_range in C++ which returns the iterators to both lower_bound and upper_bound(simply subtracting both the iterators will give you the number of elements in v2 which are same as the current element in v1) 

jranachd:
20180119 20:58:02
I am getting TLE although my java solution solves all test cases in ide. Can anyone suggest something? is it allowed to post code in the comments section 

vivek_prime:
20171223 17:41:28
my complexity is O(n*(lgn+n)). it is coming tle. any suggestions

Added by:  Luka Kalinovcic 
Date:  20090713 
Time limit:  0.360s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  own problem 