L - Helpful Maths

最新推荐文章于 2026-06-24 11:47:16 发布

原创最新推荐文章于 2026-06-24 11:47:16 发布 · 771 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#c++

结构体&&sort 专栏收录该内容

12 篇文章

订阅专栏

本文介绍了一个简单的算法，用于帮助名为Xenia的初学者数学家重新排列加法算式中的数字，使其按照非递减顺序排列，以便她能够轻松计算。输入包含一个由数字1、2、3组成的加法表达式字符串，算法会对其进行排序并输出新的易于计算的加法表达式。

L - Helpful Maths
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

#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;

int main()
{
  char n[1100];
  int i,a[1100],l,len;
   while(~scanf("%s",&n))
   {
       len=strlen(n);
       l=0;
       if(len==1)
       {
          printf("%s\n",n);
          continue;
       }
       for(i=0;i<len;i++)
       {
           if(n[i]!='+')
            a[l++]=n[i]-'0';
       }
       sort(a,a+l);
       printf("%d",a[0]);
       for(i=1;i<l;i++)
        printf("+%d",a[i]);
       printf("\n");
   }
    return 0;
}