HDU 1106

#include <iostream>#include <string>#include <vector>#include <map>#include <set>#include <algorithm>#include <iterator>#include <list>#include <stack>using namespace std;int cmp(const void*a,const void*b){    return *(int *)a-*(int *)b;}int main(){        char number[1005];    while(gets(number))    {        int i,len,k=0,kopen=0;        int num[1005];        memset(num,0,sizeof(int)*1001);        len=strlen(number);        for(i=0;i<len;)        {            if(number[i]=='5')            {                i++;            }            while(number[i]!='5' && i<len)            {                num[k]=num[k]*10+number[i]-48;                i++;                kopen=1;            }            if(kopen==1)            {                k++;                kopen=0;            }        }        qsort(num,k,sizeof(int),cmp);cout<<num[0];        for(i=1;i<k;i++)        {            cout<<" "<<num[i];        }        cout<<endl;    }    return 0; }