贪心小题,取最多*k不相等集合:
#include<iostream>
#include<cstdio>
#include<set>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=200002;
ll h[maxn];
int n,k;
int cmp(ll a,ll b)
{
return a<=b?1:0;
}
int main()
{
//freopen("D://input.txt","r",stdin);
while(scanf("%d%d",&n,&k)!=EOF)
{
int i,j;
set<ll>s;
s.clear();
for(i=0;i<n;i++) {cin>>h[i];}
sort(h,h+n,cmp);
int cnt=0;
for(i=0;i<n;i++)
{
if(s.count(h[i])==0)
{
cnt++;
s.insert(h[i]*k);
}
}
cout<<cnt<<endl;
}
return 0;
}