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 ≤ 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.
On the only line of the output print the size of the largest k-multiple free subset of {a1, a2, ..., an}.
6 2 2 3 6 5 4 10
3
In the sample input one of the possible maximum 2-multiple free subsets is {4, 5, 6}.
贪心的思想, 先将数组排序, 主要是在查找上, 数字比较大, 使用 set 进行查找 或者是 二分查找法
CODE
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
#define MAXX 200005
long long a[MAXX];
int main()
{
int n,k;
while(~scanf("%d%d",&n,&k))
{
set<long long >s;
s.clear();
for(int i=0;i<n;i++)
scanf("%lld",&a[i]);
sort(a,a+n);
int sum=0;
for(int i=0;i<n;i++)
{
if(s.count(a[i])==0)
{
sum++;
s.insert(a[i]*k);
}
}
printf("%d\n",sum);
}
return 0;
}
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<iostream>
using namespace std;
const int MAXX=200005;
long long a[MAXX];
int vis[MAXX];
int main()
{
int n,k;
while(~scanf("%d%d",&n,&k))
{
for(int i=0;i<n;i++)
scanf("%lld",&a[i]);
sort(a,a+n);
memset(vis,0,sizeof(vis));
int ans=n;
for(int i=0;i<n;i++)
{
if(!vis[i])
{
long long num=a[i]*k;
if(num>a[n-1]) continue;
int l=i+1,r=n-1;
while(l<=r)
{
int mid=(l+r)/2;
if(a[mid]>num) r=mid-1;
else if(a[mid]<num) l=mid+1;
else
{
vis[mid]=1;
ans--;
break;
}
}
}
}
printf("%d\n",ans);
}
return 0;
}