CodeForces567 C.Geometric Progression (map)

C.Geometric Progression

Polycarp loves geometric progressions very much. Since he was only three years old, he loves only the progressions of length three. He also has a favorite integer k and a sequence a, consisting of n integers.

He wants to know how many subsequences of length three can be selected from a, so that they form a geometric progression with common ratio k.

A subsequence of length three is a combination of three such indexes i1, i2, i3, that 1 ≤ i1 < i2 < i3 ≤ n. That is, a subsequence of length three are such groups of three elements that are not necessarily consecutive in the sequence, but their indexes are strictly increasing.

A geometric progression with common ratio k is a sequence of numbers of the form b·k0, b·k1, …, b·kr - 1.

Polycarp is only three years old, so he can not calculate this number himself. Help him to do it.

Input

The first line of the input contains two integers, n and k (1 ≤ n, k ≤ 2·105), showing how many numbers Polycarp’s sequence has and his favorite number.

The second line contains n integers a1, a2, …, an ( - 109 ≤ ai ≤ 109) — elements of the sequence.

Output

Output a single number — the number of ways to choose a subsequence of length three, such that it forms a geometric progression with a common ratio k.

Examples

Input

5 2
1 1 2 2 4

Output

4

Input

3 1
1 1 1

Output

1

Input

10 3
1 2 6 2 3 6 9 18 3 9

Output

6

Note

In the first sample test the answer is four, as any of the two 1s can be chosen as the first element, the second element can be any of the 2s, and the third element of the subsequence must be equal to 4.

思路:

map

因为数据大，需要开map记录
对于每个a[i],如果知道左边的a[i]/k的个数L，和右边的a[i]*k个数R，则答案累加LR
开两个map，一个记录整个数组a[i]出现的次数
一个记录当前a[i]左边的数出现的个数，总个数减去左边的个数就是右边的个数

注意判断k==1的情况和a[i]==0的情况
我的代码用了一种比价巧妙的方法解决，详见代码

code:

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
#define int long long
const int maxm=2e5+5;
int a[maxm];
map<int,int>sum;//出现总次数
map<int,int>pre;//前面出现的总次数
int n,k;
signed main(){
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++){
        sum[a[i]]++;
    }
    int ans=0;
    for(int i=1;i<=n;i++){
        int l=pre[a[i]/k];
        pre[a[i]]++;//这个放在l和r的中间，可以省去特判k==1和a[i]==0的两种情况
        int r=sum[a[i]*k]-pre[a[i]*k];
        if(a[i]%k==0){
            ans+=l*r;
        }
    }
    cout<<ans<<endl;
    return 0;
}=