（TOJ1506）Sort ZOJ7

描述

Given a string of no more than 1000 characters. You are supposed to sort the characters into a substring of all Z's followed by O's, J's, 7's, and the rest of the other characters.

输入

Each case gives a string described by the problem. The string given contains no space.

输出

For each test case, output the resulting string. Note the order of the characters other than Z, O, J and 7 must be kept after sorting.

样例输入

t7ZJ7OhO7B7O7irZtOhZdayJ77

样例输出

ZZZOOOOJJ7777777thBirthday

#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<math.h>

char a[1001],b[1001];

void deal(char *s)
{
    int i,len,c1,c2,c3,c4,j,k;
    c1=c2=c3=c4=j=0;
    len=strlen(s);
    for(i=0; i<len; i++){
        switch(s[i]){
            case'Z':c1++;break;
            case'O':c2++;break;
            case'J':c3++;break;
            case'7':c4++;break;
            default:b[j++]=a[i];break;
        }
    }
    for(k=0; k<c1; k++) printf("Z");
    for(k=0; k<c2; k++) printf("O");
    for(k=0; k<c3; k++) printf("J");
    for(k=0; k<c4; k++) printf("7");
    for(k=0; k<j; k++) printf("%c",b[k]);
    printf("\n");
}

void solve()
{
    while(gets(a)){
        deal(a);
    }
}

int main()
{
    solve();
    return 0;
}