HDU 2078

/*@问题：复习时间@time：20160420@Author：alex*/#include<stdio.h>#include<stdlib.h>//n中选m个的组合方法个数//Cn_m= n!/(m!*(n-m)!)//int Cn_m(int n,int m)//{//int element=1,denominator=1;//int count;//for(count=n-m+1;count<=n;count++)//{//denominator *= count;//}//for(count=1;count<=m;count++)//{//element *= count;//}//return (int)(denominator/element);//}void sort(int * string,int length){int i=0,j=0;int temp=0;for(i=0;i<length-1;i++){for(j=i+1;j<length j="" if="" string="" i="">*(string+j)){temp = *(string+j);*(string+j) = *(string+i);*(string+i) = temp;}}}}int main(){int T=0;int n,m;int * string = NULL;int count;int Max=0;while(scanf("%d",&T) != EOF){while(T--){Max=0;scanf("%d%d",&n,&m);string = (int *)malloc(n*sizeof(int));if(string == NULL){exit(1);}for(count=0;count<n;count++){scanf("%d",(string+count));}sort(string,n);Max = (100-*(string))*(100-*(string));printf("%d\n",Max);free(string);}}return 0;}