CodeForces 567C. - Geometric Progression(解题报告）

最新推荐文章于 2021-12-26 22:26:29 发布

原创最新推荐文章于 2021-12-26 22:26:29 发布 · 1.2k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#math

ACM 专栏收录该内容

43 篇文章

订阅专栏

本文介绍了一种算法，用于解决从给定整数序列中找出所有长度为三且公比为k的等比数列的问题。通过使用哈希表记录特定元素出现次数的方式，有效地计算出了所有符合条件的子序列数量。

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 i₁, i₂, i₃, that 1 ≤ i₁ < i₂ < i₃ ≤ 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·k⁰, b·k¹, ..., b·k^r - 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·10⁵), showing how many numbers Polycarp's sequence has and his favorite number.

The second line contains n integers a₁, a₂, ..., a_n ( - 10⁹ ≤ a_i ≤ 10⁹) — 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

Input

3 1
1 1 1

Output

Input

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

Output

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.

题意：

给你N个数，公比为k，求这n个数能组成多少个公比为K的三位等比数列。

参考代码：

#include <cstdio> 
#include <cstring> 
#include <map> 
#include <iostream> 
using namespace std; 
typedef long long LL; 
map<int, LL> s1, s2; 
int main() 
{ 
    LL n, k; 
    LL ans, x; 
	cin >> n >> k; 
	ans = 0; 
	for(int i = 0; i < n; i++) 
	{ 
	    scanf("%I64d",&x); 
		if(x%k == 0) 
		{ 
		    LL t1 = s2[x/k]; 
			ans += t1; 
			LL t2 = s1[x/k]; 
			s2[x] += t2; 
		} 
	    s1[x]++; 
	} 
	cout << ans << endl; 
    return 0; 
}