CF 567C(Geometric Progression-map)_outputstandard output polycarp loves geometric pro-优快云博客

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.

Sample test(s)

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分别找a/k,a*k

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
#include<map>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (1000000)
typedef long long ll;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int n,k;
int a[MAXN];
bool b[MAXN]={0};
int l[MAXN]={0};
int cnt[40],cnt2[40];
ll f[MAXN]={0},f2[MAXN]={0};
map<ll,int> S; 
map<ll,int>::iterator it; 
int main()
{
//	freopen("C.in","r",stdin);
//	freopen(".out","w",stdout);
	
	scanf("%d%d",&n,&k);
	For(i,n)
	{
		scanf("%d",&a[i]);
	//	while (a[i]%k==0) l[i]++,a[i]/=k; 
	}

	
	For(i,n)
	{
		if (a[i]%k==0&&S.find(a[i]/k)!=S.end()) f[i]=S[a[i]/k];

		it=S.find(a[i]);
		if (it==S.end()) S[a[i]]=1;
		else S[a[i]]++;	
		
	}
	S.clear();
	
	ForD(i,n)
	{
		if (S.find((ll)(a[i])*k)!=S.end()) f2[i]=S[((ll)(a[i])*k)];
		it=S.find(a[i]);
		if (it==S.end()) S[a[i]]=1;
		else S[a[i]]++;	
		
	}
	
	ll ans=0;
	For(i,n) ans+=f[i]*f2[i];	
	cout<<ans<<endl; 

	return 0;
}