k-Multiple Free Set

题意翻译

翻译： 有一个序列n。和一个数k 你要从中挑出尽可能多的数，保证其中不存在一对数，满足一个数是另一个数的k倍。 求最多的挑出的数。 输入格式： 第一行一个数n 第二行n个数a[i] 输出格式： 一个数表示答案。 感谢@Maniac丶坚果 提供的翻译

题目描述

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.

输入输出格式

输入格式

The first line of the input contains two integers $ n $ and $ k $ ( $ 1<=n<=10^{5},1<=k<=10^{9} $ ). The next line contains a list of $ n $ distinct positive integers $ a_{1},a_{2},...,a_{n} $ $ (1<=a_{i}<=10^{9}) $ . All the numbers in the lines are separated by single spaces.

输出格式

On the only line of the output print the size of the largest $ k $ -multiple free subset of $ {a_{1},a_{2},...,a_{n}} $ .

输入输出样例

输入样例 #1

6 2
2 3 6 5 4 10

输出样例 #1

3

说明

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