A. Helpful Maths

最新推荐文章于 2021-09-12 17:43:28 发布

在风雨中奔跑

最新推荐文章于 2021-09-12 17:43:28 发布

阅读量759

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM题目解答

本文链接：https://blog.youkuaiyun.com/zxdfc/article/details/17688371

ACM题目解答专栏收录该内容

59 篇文章

订阅专栏

本文介绍了一个简单的编程问题，旨在帮助名为Xenia的小学生能够计算仅包含1、2、3数字的有序数列之和。通过读取输入字符串并重新排序数位，确保Xenia可以轻松完成计算任务。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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简单题，第一wa了，是string，后面要加 string.h
AC code: 
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int main()
{
	char str[200],s[200];
	int i,j,l;
	while(cin>>str)
	{
		j=0;
		l=strlen(str);
		for(i=0;i<l;i++)
			if(str[i]>='0' && str[i]<='9')
				s[j++]=str[i];
			sort(s,s+j);
			for(i=0;i<j-1;i++)
			{
				cout<<s[i]<<"+";
			}
			cout<<s[i]<<endl;

	}
	return 0;
}