Good Triplets | 프로그래밍의 벗 PivotOJ
PivotOJ

Good Triplets

시간 제한: 1000ms메모리 제한: 1024MB출처: CCC 2022 SeniorBOJ 24575
이 문제는 본문 이미지 일부가 표시되지 않습니다. 텍스트만으로 풀이가 어려울 수 있습니다.

문제

Andrew is a very curious student who drew a circle with the center at (0, 0) and an integer circumference of C ≥ 3. The location of a point on the circle is the counter-clockwise arc length from the right-most point of the circle.

[이미지 1]

Andrew drew N ≥ 3 points at integer locations. In particular, the ith point is drawn at location Pi (0 ≤ Pi ≤ C − 1). It is possible for Andrew to draw multiple points at the same location.

A good triplet is defined as a triplet (a, b, c) that satisfies the following conditions:

  • 1 ≤ a < b < c ≤ N.
  • The origin (0, 0) lies strictly inside the triangle with vertices at Pa, Pb, and Pc. In particular, the origin is not on the triangle’s perimeter.

Lastly, two triplets (a, b, c) and (a', b', c') are distinct if a ≠ a', b ≠ b', or c ≠ c'.

Andrew, being a curious student, wants to know the number of distinct good triplets. Please help him determine this number.

입력

The first line contains the integers N and C, separated by one space.

The second line contains N space-separated integers. The ith integer is Pi (0 ≤ Pi ≤ C − 1).

출력

Output the number of distinct good triplets.

예제

예제 1

입력
8 10
0 2 5 5 6 9 0 0
출력
6
코드를 제출하려면 로그인하세요.