杭电1106

WC：

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

string judge(string &s)
{
    int i = 0;
    for(; i < s.size() && s[i] == '0'; ++i);
    string t(s.begin()+i, s.end());
    if(i == s.size())
        t = "0";
    s = t;
    return s;
}
void f(string& a, vector<string>& svec)
{
    int beg, end;
    beg = 0;
    for(int i = 0; i < a.size(); ++i)
    {
        if(a[i] == '5')
        {
            string t(a.begin()+beg, a.begin()+i);
            svec.push_back(judge(t));
            while(a[i] == '5')
                i++;
            beg = i;
        }
    }
    if(*(a.end()-1) != '5')
    {
        string t(a.begin()+beg, a.end());
        svec.push_back(judge(t));
    }
}
bool cmp(string a, string b)
{
    int flag = true;
    if(a.size() != b.size())
        return a.size()<b.size();
    else
        return a<b;
}

void out(vector<string> s)
{
    cout << s[0];
    for(int i = 1; i < s.size(); ++i)
        cout << " " << s[i];
    cout << endl;
}
int main()
{
    string a;
    while(cin >> a)
    {
        vector<string> svec;
        f(a, svec);
        //out(svec);
        sort(svec.begin(), svec.end(), cmp);
        out(svec);
    }
    return 0;
}

没有考虑到555551这种情况：

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

string judge(string &s)
{
    int i = 0;
    for(; i < s.size() && s[i] == '0'; ++i);
    string t(s.begin()+i, s.end());
    if(i == s.size())
        t = "0";
    s = t;
    return s;
}
void f(string& a, vector<string>& svec)
{
    int beg, end;
    for(beg = 0; a[beg] == '5'; ++beg);//555551
    for(int i = beg+1; i < a.size(); ++i)
    {
        if(a[i] == '5')
        {
            string t(a.begin()+beg, a.begin()+i);
            svec.push_back(judge(t));
            while(a[i] == '5')
                i++;
            beg = i;
        }
    }
    if(*(a.end()-1) != '5')
    {
        string t(a.begin()+beg, a.end());
        svec.push_back(judge(t));
    }
}
bool cmp(string a, string b)
{
    int flag = true;
    if(a.size() != b.size())
        return a.size()<b.size();
    else
        return a<b;
}

void out(vector<string> s)
{
    cout << s[0];
    for(int i = 1; i < s.size(); ++i)
        cout << " " << s[i];
    cout << endl;
}
int main()
{
    string a;
    while(cin >> a)
    {
        vector<string> svec;
        f(a, svec);
        //out(svec);
        sort(svec.begin(), svec.end(), cmp);
        out(svec);
    }
    return 0;
}