HDU 1106 排序

特殊数据

0051231232050775
555556
1555556
125
55552345891
1234
12345531232

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 1005
using namespace std;
char ch[N];
int main()
{
    freopen("C:\Users\super\Documents\CB_codes\in.txt", "r", stdin);
   // freopen("C:\Users\super\Documents\CB_codes\out.txt","w",stdout);
    while(~scanf("%s",ch)){
        int len=strlen(ch);

        int a[N]={0},j=0,mul=1;
        for(int i = len-1; i >= 0; i--){
            if(ch[i] == '5'){
                continue;
            }
            else{
                while(ch[i] != '5'){
                    if(i < 0)
                        break;
                    a[j] += (ch[i]-'0')*mul;
                    mul *= 10;
                    i --;
                }
                mul = 1;
                j ++;
            }
        }
        sort(a,a+j);
        printf("%d",a[0]);
        for(int i=1;i<j;i++){
            printf(" %d",a[i]);
        }
        printf("
");
    }


    fclose(stdin);
    return 0;
}