17877번 - Integer Division 다국어

문제

In C++ division with positive integers always rounds down. Because of this, sometimes when two integers are divided by the same divisor they become equal even though they were originally not equal. For example in C++, 5/4 and 7/4 are both equal to 1, but 5 ≠ 7.

Given a list of nonnegative integers and a divisor, how many pairs of distinct entries in the list are there that give the same result when both are divided by the divisor in C++?

입력

The first line of input contains two integers n (1 ≤ n ≤ 200 000), the number of elements in the list, and d (1 ≤ d ≤ 10⁹), the divisor.

The second line of input contains n integers a₁, . . . , a_n (0 ≤ a_i ≤ 10⁹), where ai is the i^th element of the list.

출력

Display a single integer indicating the number of distinct pairs of indices (i, j) with 1 ≤ i < j ≤ n such that a_i/d = a_j/d when using integer division in C++. Note that the numbers in the list are not necessarily distinct (i.e. it is possible that a_i = a_j for some indices i ≠ j).

제한

힌트