#include <stdio.h>
int elimination(int a[], int count){ //去除数组中重复的元素
int i, j, k;
for (i = 0; i < count; i++){
for (j = i + 1; j < count; j++){
if (a[j] == a[i]){
for (k = j + 1; k< count; k++)
a[k - 1] = a[k];
count--;
j--;
}
}
}
return count;
}
int maopao_sort(int a[],int n){
int i,j;
for(i=0;i<n-1;i++){
for(j=0;j<n-1-i;j++){
if(a[j]>a[j+1]){
int temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}
int main(){
int i,a[1000],n,k,j;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%d",&a[i]);
}
k=elimination(a,n);
printf("%d\n",k);
maopao_sort(a,k);
for(i=0;i<k;i++){
printf("%d ",a[i]);
}
return 0;
}
洛谷明明的随机数题解
最新推荐文章于 2022-03-16 10:38:15 发布