三角形集合 - Problem

#1374. 三角形集合

Statistics

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

如果一个正整数集合的大小至少为三，且对于该集合中任意三个不同的整数，都能构成一个以这三个数为边长的三角形，则称该集合为“三角形集合”（triangular）。

给定一个正整数集合，计算其“三角形集合”子集的数量。

输入格式

输入的第一行包含一个整数 $n$ ($1 \le n \le 50$)，表示集合中整数的个数。

接下来的 $n$ 行，每行包含一个整数 $x$ ($1 \le x \le 10^9$)。这些是集合中的元素，保证互不相同。

输出格式

输出一个整数，表示给定集合中“三角形集合”子集的数量。

样例

样例输入 1

样例输出 1

样例输入 2

样例输出 2

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0