B - Helpful Maths

Posted 霜雪千年

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了B - Helpful Maths相关的知识,希望对你有一定的参考价值。

Problem description

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 sis 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.

Examples

Input
3+2+1
Output
1+2+3
Input
1+1+3+1+3
Output
1+1+1+3+3
Input
2
Output
2
解题思路:取出原字符串中的所有数字字符到一个int数组中,排序,然后按格式输出即可,水过。
AC代码:
 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int main(){
 4     char str[105];int k=0,num[105];
 5     cin>>str;
 6     for(int i=0;str[i]!=\0;++i)
 7         if(i%2==0)num[k++]=str[i]-0;
 8     sort(num,num+k);
 9     for(int i=0;i<k-1;++i)
10         cout<<num[i]<<+;
11     cout<<num[k-1]<<endl;
12     return 0;
13 }
 

以上是关于B - Helpful Maths的主要内容,如果未能解决你的问题,请参考以下文章

Codeforces Round #197 (Div. 2) A. Helpful Maths字符串/给一个连加计算式,只包含数字 123,要求重新排序,使得连加的数字从小到大

C. Neko does Maths(数论 二进制枚举因数)

CodeForces-1152C Neko does Maths(GCD)

P2393-yyy loves Maths II

codeforce 1152C. Neko does Maths(欧几里得算法)

Codeforces Round #554 (Div. 2) C.Neko does Maths (gcd的运用)