#197 (Div.2) A. Helpful Maths

1. Title Description: Click to open the link

2. Problem-Solving ideas: Extract all the numbers, sorted after the output can be.

3. Code:

#define _crt_secure_no_warnings#include<iostream> #include <algorithm> #include <string> #include <sstream> #include <set> #include <vector> #include <stack> #include <map> #include < queue> #include <deque> #include <cstdlib> #include <cstdio> #include <cstring> #include < cmath> #include <ctime> #include <functional>using namespace std; #define ME (s) memset (s,0,sizeof (s)) typedef long Long ll;typedef unsigned int uint;typedef unsigned long long ull;typedef pair <int, int> p;const int n= 100;char s[n];int A[n];int Main () {    while (~scanf ("%s", s))    {        me (a);        int Len=strlen (s);        for (int i=0;i<len;i+=2)            a[i/2]=s[i]-' 0 ';        Sort (a,a+len/2+1);        for (int i=0;i<len/2+1;i++)            printf ("%d%c", A[i], "+\n" [I==LEN/2]);}    }

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

#197 (Div.2) A. Helpful Maths