样例1
#include <bits/stdc++.h>
using namespace std;
const int N=1000;
int main()
{
int n,a[N];
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
sort(a,a+n);
int k=1;//k前指针(k=1是因为把第一个数直接算作不重复)
for(int i=1;i<n;i++)//i后指针
{
if(a[k-1]!=a[i])
{
a[k]=a[i];
k++;//同时k用来记录不重的数量
}
}
cout<<k<<endl;
return 0;
}
样例2
’‘’
include [HTML_REMOVED]
using namespace std;
const int N=1000;
int main()
{
int n,a[N];
cin>>n;
for(int i=0;i[HTML_REMOVED]>a[i];
sort(a,a+n);
int k=1;
for(int i=1;i<n;i)
{
if(a[i]!=a[i-1]) k;
}
cout<<k<<endl;
return 0;
}
‘’‘
样例三
’‘’
include [HTML_REMOVED]
using namespace std;
const int N=1001;
int get_unique_count(int a[], int n)
{
int b[N],k=0;
for(int i=0;i[HTML_REMOVED]>n;
for(int i=0;i[HTML_REMOVED]>a[i];
cout<<get_unique_count(a,n)<<endl;
return 0;
‘’‘
样例4
’‘’
include [HTML_REMOVED]
using namespace std;
const int N=1000;
int get_unique_count(int a[],int n)
{
int k=1;
for(int i=0;i[HTML_REMOVED]>n;
for(int i=0;i[HTML_REMOVED]>a[i];
cout<<get_unique_count(a,n)<<endl;
return 0;
}
‘’‘
样例5
’‘’
include [HTML_REMOVED]
using namespace std;
int main()
{
int n,a[N];
cin>>n;
for(int i=0;i[HTML_REMOVED]>a[i];
sort(a,a+n);
cout<<unique(a,a+n)-a<<endl;
return 0;
}
‘’‘