Codeforence 393A
来源:互联网 发布:京东通信网络不能用 编辑:程序博客网 时间:2024/06/03 10:29
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. 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.
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
这个题目是说这个人在计算的时候一定要按顺序来计算,否则就不能算下去,所以排一下序,然后输出来就是了
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int main(){ char s[200]; int num[200]; int i,j,k; while(scanf("%s",s)!=EOF) { int l=strlen(s); if(l==1) { printf("%s\n",s); continue; } int h=0; for(i=0;i<l;i++) { if(s[i]!='+') { num[h]=s[i]-'0'; h++; } } sort(num,num+h); for(i=0;i<h-1;i++) { printf("%d",num[i]); printf("+"); } printf("%d\n",num[i]); } return 0;}
- Nineteen Codeforence 393A
- Codeforence 393A
- Codeforence 352A
- Codeforence 337A Puzzles
- Codeforence 402 A. Nuts
- Codeforence A. Slightly Decreasing Permutations
- Codeforence 400 A. Inna and Choose Options
- Codeforence 258A. Little Elephant and Bits
- Codeforence 408 B. Garland
- Codeforence 23C Oranges and Apples
- Codeforence 23 B. Party 比较有趣的思维问题
- CodeForce 393A Nineteen
- codeforces 393A Nineteen
- CF 393A:Nineteen
- a
- a
- a
- a
- 提示磁盘被写保护怎么办?
- leetcode--Combination Sum
- 查看数据库事务默认级别
- DOM方式对xml文档的增删改查
- 数据库操作(SQLite)
- Codeforence 393A
- jdk 1.7中 ArrayList的容量增长方式
- 分享与自我表现
- MariaDB 特性介绍-动态虚拟列
- 如何高效地做到大文本去除重复行
- container_of
- Android TV 屏幕适配相关
- Postgresql 创建主键并设置自动递增的三种方法
- 竟然用了40分钟。。Binary Tree Maximum Path Sum