poj 1106

// 5为空格，排序输出

#include <cstdio>#include <string>#include <iostream>#include <cstring>#include <algorithm>using namespace std;string str;long long num[1005];int main(){    int i = 0;    while (cin >> str)    {        memset(num, 0, sizeof(num));        i = 0;        for(int j=0; j<str.length();)        {            int temp=str[j]-'0';            if(temp!=5)            {                num[i]=num[i]*10+temp;                j++;            }            else            {                if(j)                    i++;                while(str[j]=='5')                    j++;                if(j>str.length()-1)                    i--;            }        }        sort(num, num + i + 1);        cout << num[0];        for (int k = 1; k <= i; k++)            cout << " " << num[k];        cout << endl;    }    return 0;}