|
|
|
|
讨论 Discussion |
|
|
123456789 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
freopen("p1057.in","r",stdin);
freopen("p1057.out","w",stdout);
int n,i,j,k,t,a[100001]={0},b[100001]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
sort(a+1,a+n+1);
k=0;
for(i=1;i<=n;i++){
t=0;
for(j=1;j<=k;j++)if(b[j]==a[i]){
t=1;break;
}
if(t==0){
k++;
b[k]=a[i];
}
}
for(i=1;i<=k;i++)cout<<b[i]<<endl;
return 0;
}
( ) |
|
|
|
|
|
|
|
|
|
Flag |
|
题号 |
P1748 |
|
模拟 |
通过 |
34人 |
提交 |
133次 |
通过率 |
26% |
难度 |
0 |
|
|
|
|
|
|