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 2 2 3 2 -1 1 3 5 7 10
1 4 24 10
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判断结束。
編號 | 身分 | 題目 | 主題 | 人氣 | 發表日期 |
41862 | eric09253251 ... (s1111505) | a064 | 57 | 2024-09-03 01:21 | |
32074 | yes51851823@ ... (wseds) | a064 | 419 | 2022-09-12 03:49 |