提示: 欢迎访问OurACM平台。
Problem 1665 Combination Pairs

Accept: 120    Submit: 250
Time Limit: 1000 mSec    Memory Limit : 32768 KB

Problem Description

There are N numbers in an array.
Each time you can select two numbers in the array.
If the product of the two numbers A and B you selected is larger than the target number T, we say it is a valid combination pair (A, B).
Now your task is to calculate there are how many combination pairs in the array.
You should note that the combination pair (A, B) is the same to the combination pair (B, A) and we should calculate the pair just once.

Input

There are multiply test cases. For each test case, the first line are two integer N and T(2≤N≤100, -10^9≤T≤10^9). In the second line, there are N integers which are separated by a space. It is guaranteed that the element in the array will fit within a 32-bit integer.

Output

For each test case, output the number of Combination Pairs.

Sample Input

2 0 1 2 3 1 1 2 -1 3 -2 1 2 -1 3 0 1 1 2

Sample Output

1 1 2 2

Source

FOJ月赛-2008年11月

Submit  Back  Status  Discuss