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
|
Jumpy:
2019-04-21 16:46:05
The above equations can be written as:
|
|
gs959_me:
2019-04-10 18:45:16
while using unordered map initialize the size as N^3, in order to avoid TLE |
|
josecaz1:
2019-04-07 22:51:20
Don't forget to use unordered_map! Cost me 1 WA |
|
rohan_14:
2019-02-15 18:23:40
Last edit: 2019-02-15 18:24:07 |
|
starun8795:
2019-01-16 13:15:13
In 11th test case d=0 so don't forget to apply a check. |
|
rohitkk074:
2019-01-13 11:56:14
AC in one go. |
|
md_meraj1319:
2018-12-18 18:05:05
TO SOLVE THE PROBLEM ALL SEXTUPLES SHOULD BE GENERATED OR NOT? |
|
xandfury:
2018-12-09 08:20:20
Last edit: 2018-12-09 08:28:40 |
|
jeeruajay:
2018-08-21 09:19:28
how binary search works ? |
|
chandyshot:
2018-08-19 04:40:27
Remember d!=0 |
Added by: | Luka Kalinovcic |
Date: | 2009-07-13 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
Resource: | own problem |