A. k-Multiple Free Set_a.k-multiple free set-优快云博客

这篇博客讨论了如何找到一个整数集合中最大的k倍数自由子集的大小。给定一个包含n个不同正整数的集合和一个整数k，目标是找出不包含k倍关系的数的最大子集数量。输入包括n和k，以及n个不同的正整数。输出是满足条件的子集大小。示例中，对于输入数据，最大的2倍数自由子集可以是{4, 5, 6}。" 108704715,7772583,机器学习基础：特征工程详解,"['机器学习', '特征工程', '数据预处理', '文本分析', '特征选择']

链接：https://codeforces.com/contest/274/problem/A

A k-multiple free set is a set of integers where there is no pair of integers where one is equal to another integer multiplied by k. That is, there are no two integers x and y (x < y) from the set, such that y = x·k.

You're given a set of n distinct positive integers. Your task is to find the size of it's largest k-multiple free subset.

Input

The first line of the input contains two integers n and k (1 ≤ n ≤ 105, 1 ≤ k ≤ 109). The next line contains a list of n distinct positive integers a1, a2, ..., an (1 ≤ ai ≤ 109).

All the numbers in the lines are separated by single spaces.

Output

On the only line of the output print the size of the largest k-multiple free subset of {a1, a2, ..., an}.

Examples

input

Copy

6 2
2 3 6 5 4 10

output

Copy

Note

In the sample input one of the possible maximum 2-multiple free subsets is {4, 5, 6}.

代码：

#include<bits/stdc++.h>
using namespace std;
long long n,t,k,s,d,max1=0,b,c,mod=1e9+7;
long long a[100005];
map<long long,long long>m,p;
int main()
{
	cin>>n>>k;
	s=0;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	sort(a+1,a+1+n);
	for(int i=1;i<=n;i++)
	{
		if(a[i]%k!=0||(a[i]%k==0&&m[a[i]/k]==0))
		{
			m[a[i]]++;
			s++;
		}
	}
	if(k==1)
	s=n;
	cout<<s;
}