Problem--339A--Codeforces-- A. Helpful Maths
2017-04-06 16:11
465 查看
A. Helpful Maths
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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
01__ 冒泡
10__桶
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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
01__ 冒泡
#include<stdio.h> #include<string.h> int main(){ char num[105]; scanf("%s",num); for(int i=0;i<strlen(num)-1;i+=2){ for(int j=0;j<strlen(num)-i-2;j+=2){ if(num[j]>num[j+2]){ char temp=num[j]; num[j]=num[j+2]; num[j+2]=temp; } } } printf("%s\n",num); }
10__桶
#include <stdio.h> #include <string.h> int main() { char s[150]; int num[4]={0}; int i; scanf("%s",s); for(i=0;i<strlen(s);i++) { if(s[i]=='+') continue; num[s[i]-'0']++; } i=0; while(num[i]==0)i++; printf("%d",i); num[i]--; while(num[i]==0)i++; while(i<=3) { printf("+%d",i); num[i]--; while(num[i]==0)i++; } return 0; }
相关文章推荐
- CodeForces-339A-Helpful Maths
- 代码实现问题 [CodeForces-893A] [Problem A]
- Codeforces-798C-Mike and gcd problem(贪心+数论)
- CodeForces 340 C.Tourist Problem(组合数学)
- Codeforces 749A-Bachgold Problem
- codeforces 629-B. Far Relative’s Problem(思想)
- Codeforces 845G Shortest Path Problem
- CodeForces 443D - Andrey and Problem(贪心)
- codeforces 803G Periodic RMQ Problem
- [Codeforces 863D]Yet Another Array Queries Problem
- Codeforces 776D:The Door Problem
- codeforces 之 Another Problem on Strings
- Problem--282A--Codeforces--BIt++
- Codeforces 706C Hard problem
- CodeForces - 633B A Trivial Problem(找规律)
- Problem - 218B - Codeforces
- codeforces 45G Prime Problem
- Codeforces Round #427 (Div. 2) Problem B The number on the board (Codeforces 835B) - 贪心
- codeforces 789/problem/B [map][坑]
- Codeforces 472D Design Tutorial: Inverse the Problem【MST+SPFA+思维】