基于基数排序,时间复杂度为O(nlogM)
M=Max(abs(v[i]))i=0,1,.,,,n-1;
include[HTML_REMOVED]
using namespace std;
int n,cnt=0;
vector[HTML_REMOVED]v(1004);
int Pow[10];
void Sort(int k){
cnt=0;
vector[HTML_REMOVED] >mp;
for(int i=0;i<10;i){
vector[HTML_REMOVED]vv;
mp.push_back(vv);
}
for(int i=0;i[HTML_REMOVED]>n;
Pow[0]=1;
for(int i=1;i<10;i)Pow[i]=Pow[i-1]*10;
for(int i=0;i[HTML_REMOVED]>v[i];
}
for(int i=0;i<9;i){
Sort(i);
}
cnt=1;
for(int i=1;i<n;i){
if(v[i]!=v[i-1])cnt++;
}
cout<<cnt;
return 0;
}