CF197#DIV2:A-Helpful Maths

62 阅读 0 评论 41 点赞

我是靠谱客的博主生动大炮，最近开发中收集的这篇文章主要介绍CF197#DIV2:A-Helpful Maths，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

http://codeforces.com/contest/339/problem/A

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

Output

题意：将一个加法公式从小到大排序就可以了

思路：超级水题，由于每个数字只有1,2,3，这三种可能，不需要考虑太多

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int main()
{
char str[1005];
int a[1005],i,len,l;
while(~scanf("%s",&str))
{
len = strlen(str);
l = 0;
if(len == 1)
{
printf("%sn",str);
continue;
}
for(i = 0;i<len;i++)
{
if(str[i]!='+')
a[l++] = str[i]-'0';
}
sort(a,a+l);
printf("%d",a[0]);
for(i = 1;i<l;i++)
printf("+%d",a[i]);
printf("n");
}
return 0;
}