跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2547. k-Multiple Free Set

    ID: 2553 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 4 上传者: 标签>二分贪心排序算法思想编程与模拟进阶难度共享题库Codeforces英文题面题目来源题面语言

k-Multiple Free Set

题目描述

A. k-Multiple Free Set
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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
6 2
2 3 6 5 4 10
Output
3
Note

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

题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 2193 题。保留原作者与原赛事署名。