CF197#DIV2:A-Helpful Maths
来源:互联网 发布:淘宝金酷娃消防车视频 编辑:程序博客网 时间:2024/05/29 16:20
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.
The first line contains a non-empty string s — the sum Xenia needs to count. Strings contains no spaces. It only contains digits and characters "+". Besides, strings is a correct sum of numbers 1, 2 and 3. Strings is at most 100 characters long.
Print the new sum that Xenia can count.
3+2+1
1+2+3
1+1+3+1+3
1+1+1+3+3
2
2
题意:将一个加法公式从小到大排序就可以了
思路:超级水题,由于每个数字只有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("%s\n",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;}
- CF197#DIV2:A-Helpful Maths
- A. Helpful Maths
- A. Helpful Maths
- 339A - Helpful Maths
- 【CodeForces】A. Helpful Maths
- CodeForces 339A Helpful Maths
- CodeForces-339A-Helpful Maths
- CF 339A Helpful Maths
- codeforces 339A Helpful Maths
- Problem--339A--Codeforces-- A. Helpful Maths
- Helpful Maths
- Helpful Maths
- Helpful Maths
- #197 (div.2) A. Helpful Maths
- CodeForces 339 A.Helpful Maths(水~)
- codeforces 339A.Helpful Maths B.Xenia and Ringroad 两水题
- Codeforces Round #197 (Div. 2) A. Helpful Maths
- Codeforces Round #197 (Div. 2)A. Helpful Maths
- pat 1012. The Best Rank (25)
- linux常用命令—alaric珍藏版
- Linux内核中的Kconfig、Makefile、.config
- iOS开发之 Json解析的四种方法
- 深入研究 C++中的 STL Deque 容器
- CF197#DIV2:A-Helpful Maths
- 前端Web服务器+后台MySQL数据库+NFS服务
- B. Ciel and Flowers
- HDU 1142 A Walk Through the Forest
- 【rzxt】教你如何删除注册表的U盘使用记录
- android 蓝牙模块遇到的问题,关闭蓝牙以后下次不能正常连接
- Test
- CSS3之选择器
- VS2012:error LNK2026: 模块对于 SAFESEH 映像是不安全的