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
|
nilabja16180:
2017-03-03 10:00:47
1.85 sec, still it passes! |
|
vladimira:
2017-02-28 02:20:46
Some hate comments bcs of TLEs =)) But I think its a good problem for two reasons: 1 - simple arithmetic formula gives so many ways of making an algorithm 2 - makes you understand how to code same thing in fastest way |
|
cake_is_a_lie:
2017-02-15 03:14:05
So many chances to get bugs on this one SIGFPE > SIGSEGV > WAs (curse you operator %; why don't you learn some math?!), but finally AC in 0.36s; no binary search just iterating over a, b, d and some lookup tables.
|
|
holmesherlock:
2017-02-02 21:32:04
"d!=0" gave me too many WA |
|
kapillamba4:
2017-01-29 15:14:09
is it even possible to solve this problem in around 0.04 seconds ? how are the top guys able to do it, seems impossible to me :|
|
|
jatin9533:
2017-01-21 17:38:05
can anyone please explain the first two test cases i.e. for n=1 & n=2 |
|
vunnamtej:
2017-01-12 10:32:05
1.25s with bounds and 1.51s with binary search modified |
|
n963:
2016-12-29 14:52:47
AC!! Last edit: 2017-01-05 05:28:28 |
|
Aditya krishna namdeo:
2016-12-15 20:32:52
d!=0 :)
|
|
sas1905:
2016-11-15 16:19:23
AC in first go..:) |
| 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 |
RSS