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}.
Sample test(s)
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}.
输入n,k.以及a,求a中最长的连续非k倍序列的长度
需要注意超时问题
# coding=utf-8
n, k = list(map(int, input().split(‘ ‘)))
a = list(map(int, input().split(‘ ‘)))
a.sort()
s = []
d = {}
m = 0
for i in a:
if i % k != 0:
s.append(i)
d[i] = 1
m += 1
elif (i // k) not in d:
s.append(i)
d[i] = 1
m += 1
print(m)
codeforces 274A k-Multiple Free Set
原文：http://my.oschina.net/sherlocked/blog/524925