#include
void bubble_sort(int a[], int n)
{int i, j, temp;
for (j = 0; j < n - 1; j++)
for (i = 0; i < n - 1 - j; i++)
{if(a[i] < a[i + 1])
{temp = a[i];
a[i] = a[i + 1];
a[i + 1] = temp;
}
}
}
int main()
{ int i, SIZE = 10, n = 1, number[10];
for (i = 0; i < SIZE; i++)
scanf("%d",&number[i]);
bubble_sort(number, SIZE);
for(i = 1; i < SIZE && number[i] == number[i-1]; i++)n++;
printf("最大的数是%d，出现次数为%d\n",number[0],n);
}
内容全部来源于网络收集，如有侵权，请联系网站删除：QQ：24596024