int fun(int x[])
{ int i,j,k,t,mid,b[N];for(i=0;i<N;i++) b[i]=x[i];for(i=0;i<=N/2;i++){ k=i;for(j=i+1;j<N;j++) if(b[k]>b[j]) k=j;if(k != i ){/found/t=b[i]; b[i]=b[k]; b[k]=t;}/found/mid=b[4];for(i=0; i<N; i++)/found/if(x[i] < mid) x[i]=mid;return mid;}int fun( int *b ){/found/int t[N] ,i, num=0;for(i=0; i<N; i++)if(b[i]>=10)/found/t[num++]=b[i];/found/for(i=0; i<num; i++)b[i]=t[i];return( num );}int fun(char *s){int n=0;char *p;for(p=s;*p!=’\0’;p++)if((*p>=‘0’)&&(*p<=‘9’))n++;return n;}
2021-07-21
最新推荐文章于 2021-07-29 21:37:06 发布