我是靠谱客的博主 火星上长颈鹿,这篇文章主要介绍Codeforces——339A Helpful Maths,现在分享给大家,希望可以做个参考。

小声BB

大清早是真的不清醒,差点错了

题干

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.

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

分析

这道题思路有两种,一种是取字符串直接处理,直接排序后标记“+”的起始位,两侧轮流输出;一种是只读入数字,排序后输出时数字之间加入“+”,这里采用第二种方法。

代码

复制代码
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
#include<iostream> #include<algorithm> using namespace std; int main() { int a[100],i = 0; while(scanf("%d",&a[i]) != EOF) i++; sort(a,a + i); for(int j = 0;j < i;j++) { if(j != 0) cout << '+'; cout << a[j]; } return 0; }

最后

以上就是火星上长颈鹿最近收集整理的关于Codeforces——339A Helpful Maths的全部内容,更多相关Codeforces——339A内容请搜索靠谱客的其他文章。

本图文内容来源于网友提供,作为学习参考使用,或来自网络收集整理,版权属于原作者所有。
点赞(65)

评论列表共有 0 条评论

立即
投稿
返回
顶部