1 solutions
-
0
C :
#include <stdio.h> #include <math.h> #include <string.h> #include <stdlib.h> #include <time.h> #define N 10 void jsSort(char xx[]) { char ch ; int half,j, k; half=strlen(xx)/2; for(j = 0 ; j < (int) half-1 ; j++) for(k=j+1;k<half;k++) if(xx[j]<xx[k]) {ch=xx[j]; /*交换相邻元素*/ xx[j]=xx[k]; xx[k]=ch; }//排序 for(j=half-1,k=strlen(xx)-1;j>=0;j--,k--) {ch=xx[j]; xx[j]=xx[k]; xx[k]=ch; } } int main() { // freopen("in","r",stdin); // freopen("out","w",stdout); char x[80]; int n,i; while(scanf("%d",&n)!=EOF){ for(i=0;i<n;i++) { scanf("%s",x); jsSort(x); printf("%s\n",x); } } return 0; }
- 1
Information
- ID
- 18192
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By