a064: SPOJ 4580.ABCDEF
Tags :
Accepted rate : 62人/77人 ( 81% ) [非即時]
評分方式:
Tolerant

最近更新 : 2011-08-29 23:27

Content

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.

Sample Input #1
1
1

2
2
3

2
-1
1

3
5
7
10
Sample Output #1
1

4

24

10
測資資訊:
記憶體限制: 512 MB
公開 測資點#0 (10%): 2.0s , <1K
公開 測資點#1 (10%): 2.0s , <1K
公開 測資點#2 (10%): 2.0s , <1K
公開 測資點#3 (10%): 2.0s , <1K
公開 測資點#4 (10%): 2.0s , <1K
公開 測資點#5 (10%): 2.0s , <1K
公開 測資點#6 (10%): 2.0s , <1K
公開 測資點#7 (10%): 2.0s , <1K
公開 測資點#8 (10%): 2.0s , <1K
公開 測資點#9 (10%): 2.0s , <1K
Hint :
Added by:Luka Kalinovcic
Date:2009-07-13
Time limit:2s
Source limit:50000B
Languages:All except: ERL JS PERL 6
Resource:

own problem

 

 

 

 

题目来源SPOJ 4580,输入只有一笔,不用EOF判断结束。

Tags:
出處:
SPOJ 4580 [管理者:
liouzhou_101 (王启圣)
]


ID User Problem Subject Hit Post Date
沒有發現任何「解題報告」