zoukankan      html  css  js  c++  java
  • A. 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
     1 #include <stdio.h>
     2 #include <string.h>
     3 #include <algorithm>
     4 using namespace std;
     5 bool compare (int a,int b){
     6 return a<b;
     7 }
     8 int main(){
     9     char str[1005];
    10     int a[1005],i,len,l;
    11     while(~scanf("%s",str)){
    12         len=strlen(str);
    13         l=0;
    14         if(len==1){
    15             printf("%s
    ",str);
    16             continue;
    17         }
    18             for(i=0;i<len;i++){
    19                 if(str[i]!='+')
    20                     a[l++]=str[i]-'0';
    21             }
    22             sort(a,a+l,compare);   //也可以不用compare
    23             printf("%d",a[0]);
    24             for(i=1;i<l;i++)
    25                 printf("+%d",a[i]);
    26                 printf("
    ");
    27     }
    28     return 0;
    29 }
  • 相关阅读:
    C++中类模板的概念和意义
    欢迎访问新博客aiyoupass.com
    P2327
    P2885
    P1968
    Link-Cut-Tree
    树的重心
    点分治笔记
    SPOJ 375
    树链剖分
  • 原文地址:https://www.cnblogs.com/z-712/p/7307419.html
Copyright © 2011-2022 走看看