a064.
SPOJ 4580.ABCDEF
內容
You are given a set S of integers between -30000 and 30000 (inclusive).
Find the total number of sextuples that satisfy:
輸入說明
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 the total number of plausible sextuples.
範例輸入
#1
1 1 2 2 3 2 -1 1 3 5 7 10
範例輸出
#1
1 4 24 10
測資資訊：
記憶體限制：
512
MB
提示 ：
| 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判断结束。
標籤:
出處:
SPOJ 4580
[管理者：
liouzhou_101
(王启圣)
]
| 編號 | 身分 | 題目 | 主題 | 人氣 | 發表日期 |
| 41862 |
|
a064 | 73 | 2024-09-03 01:21 | |
| 32074 |
|
a064 | 435 | 2022-09-12 03:49 |