codeforce Helpful Maths

Helpful Maths

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Xenia the beginner mathematician is a third year student at elementary school. She is now learning the addition operation.

The teacher has written down the sum of multiple numbers. Pupils should calculate the sum. To make the calculation easier, the sum only contains numbers 1, 2 and 3. Still, that isn't enough for Xenia. She is only beginning to count, so she can calculate a sum only if the summands follow in non-decreasing order. For example, she can't calculate sum 1+3+2+1 but she can calculate sums 1+1+2 and 3+3.

You've got the sum that was written on the board. Rearrange the summans and print the sum in such a way that Xenia can calculate the sum.

Input

The first line contains a non-empty string s — the sum Xenia needs to count. String s contains no spaces. It only contains digits and characters "+". Besides, string s is a correct sum of numbers 1, 2 and 3. String s is at most 100 characters long.

Output

Print the new sum that Xenia can count.

Sample test(s)

input

3+2+1

output

1+2+3

input

1+1+3+1+3

output

1+1+1+3+3

input

2

output

2

好水的一题，本来以为要将数据转化为数字，后来灵感一来，发现其实压根就不需要，STL中的sort()函数就可以对字符串进行排序，只要将“+”处理一下就好了，说白了，就是将“+”号去掉，然后进行排序。最后输出。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char ch[105];
char ch1[105];
int main()
{
    int len;
    scanf("%s", ch);
    len=strlen(ch);
    if(1==len)
        printf("%s\n", ch);
    else
    {
        int i;
        int j=0;
        for(i=0; i<len; ++i)
            if(ch[i]!='+')
            {
                ch1[j++]=ch[i];
            }
        sort(ch1, ch1+j);
        printf("%c", ch1[0]);
        for(i=1; i<j; ++i)
            printf("+%c", ch1[i]);
        printf("\n");
    }
    return 0;
}