text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
void sort(int arr[], int n) {
int temp = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= n - i; j++) {
if (arr[j] > arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
int main() {
char string[202];
scanf("%s", string);
int arr[202] = {0};
int n = 1;
int batas = strlen(string);
for (int i = 0; i < batas; i++) {
if (string[i] >= 48 && string[i] <= 57) {
arr[n] = (string[i] - '0');
n++;
}
}
sort(arr, n - 1);
for (int i = 1; i < n; i++) {
if (i == n - 1) {
printf("%d\n", arr[i]);
} else {
printf("%d+", arr[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s1;
string s2 = "";
int main() {
cin >> s1;
for (int i = 0; i < s1.length(); i++)
if (i % 2 == 0) s2 += s1[i];
sort(s2.begin(), s2.end());
for (int i = 0; i < s2.length(); i++) {
cout << s2[i];
if (i != s2.length() - 1) cout << '+';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int comp_double(double a, double b) {
if (fabs(a - b) <= 1e-10) return 0;
return a < b ? -1 : 1;
}
string s;
char c;
int main() {
cin >> s;
sort(s.begin(), s.end());
for (int i = (s.size() / 2), j = 0; j < s.size(); j++) {
if ((j & 1) && (j != (s.size() - 1)))
cout << '+';
else {
cout << s[i];
i++;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char ch[101];
cin >> ch;
for (int i = 0; i < strlen(ch); i += 2) {
int currMin = ch[i] - '0';
int minIndex = i;
for (int j = i + 2; j < strlen(ch); j += 2) {
if (currMin > ch[j] - '0') {
currMin = ch[j] - '0';
minIndex = j;
}
}
swap(ch[i], ch[minIndex]);
}
cout << ch << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
char arr[100];
int d = s.length();
for (int i = 0; i < d; i++) {
arr[i] = s[i];
}
sort(arr, arr + d);
for (int i = 0; i < d; i++) {
if (i == d - 1) {
cout << arr[i];
} else {
if (arr[i] >= 49) cout << arr[i] << '+';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char str[5000];
while (gets(str)) {
int len = strlen(str);
int num[1000];
int i, k = 0;
for (i = 0; i < len; i++) {
if (str[i] >= '1' && str[i] <= '3') num[k++] = str[i] - '0';
}
sort(num, num + k);
for (i = 0; i < k; i++) {
printf("%d", num[i]);
if (i != k - 1) printf("+");
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, s1;
cin >> s;
char c;
for (int i = 0; i < s.size(); i += 2) {
s1 += s[i];
}
std::sort(s1.begin(), s1.end());
if (s1.size() == 1)
cout << s1;
else {
for (int i = 0; i <= s1.size() - 2; i++) cout << s1[i] << "+";
cout << s1[s1.size() - 1];
}
}
|
#include <bits/stdc++.h>
using namespace std;
void swap(string &v, int a, int b) {
int temp = v[a];
v[a] = v[b];
v[b] = temp;
}
int main() {
string v;
cin >> v;
int len = v.size();
int one = 0;
int three = len - 1;
while (one < len && (v[one] == '1')) {
one += 2;
}
while (three >= 0 && (v[three] == '3')) {
three -= 2;
}
int index = one;
while (index <= three) {
if ((v[index] == '1') && (index != one)) {
swap(v, index, one);
one += 2;
continue;
}
if ((v[index] == '3') && (index != three)) {
swap(v, index, three);
three -= 2;
continue;
}
index += 2;
}
cout << v;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, s1;
cin >> s;
sort(s.begin(), s.end());
for (int i = 0; i < s.size(); i++) {
if (s[i] != '+') {
s1 += s[i];
}
}
for (int i = 0; i < s1.size(); i++) {
if (i == s1.size() - 1)
cout << s1[i];
else
cout << s1[i] << "+";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int len, i, j = 0;
int arr[3];
arr[0] = arr[1] = arr[2] = 0;
cin >> str;
len = str.length();
for (i = 0; i < len; i += 2) {
if (str[i] == '1') {
arr[0] += 1;
} else if (str[i] == '2') {
arr[1] += 1;
} else {
arr[2] += 1;
}
}
for (i = 0; i < len; i += 2) {
if (arr[j] > 0) {
str[i] = '0' + j + 1;
arr[j] -= 1;
} else {
j += 1;
i -= 2;
}
}
cout << str;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s;
long long a[1005];
long long count = 0;
cin >> s;
for (long long i = 0; i < s.size(); i += 2) {
a[count++] = s[i] - '0';
}
sort(a, a + count);
for (long long i = 0; i < count; i++) {
cout << a[i];
if (i != count - 1) {
cout << "+";
}
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool Check(char x) {
if (x <= '3' && x >= '1')
return true;
else
return false;
}
int main() {
char s[1000];
cin >> s;
char x;
for (int i = 0; i < strlen(s); ++i) {
for (int j = i + 1; j < strlen(s); ++j) {
if (s[j] < s[i] && Check(s[i]) && Check(s[j])) {
x = s[i];
s[i] = s[j];
s[j] = x;
}
}
}
for (int i = 0; i < strlen(s); i++) {
cout << s[i];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
vector<char> v;
cin >> str;
for (int i = 0; i < str.length(); i += 2) v.insert(v.end(), str[i]);
sort(v.begin(), v.end());
cout << v[0];
for (int i = 1; i < v.size(); i++) cout << "+" << v[i];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using LL = int64_t;
const int INF = 0x3f3f3f3f;
const int maxn = 1e6 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
int num[100];
cin >> s;
int cnt = 0;
for (int i = 0; i < s.length(); i += 2) {
num[cnt++] = s[i] - '0';
}
sort(num, num + cnt);
for (int i = 0; i < cnt; i++) {
if (i) cout << '+';
cout << num[i];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i = 0, c1 = 0, c2 = 0, c3 = 0;
if (s[0] == '1')
c1++;
else if (s[0] == '2')
c2++;
else
c3++;
i += 2;
while (s[i - 1] != '\0') {
if (s[i] == '1')
c1++;
else if (s[i] == '2')
c2++;
else
c3++;
i += 2;
}
i = 0;
if (c1 != 0) {
cout << "1";
c1--;
} else if (c2 != 0) {
cout << "2";
c2--;
} else {
cout << "3";
c3--;
}
while (i < c1) {
cout << "+1";
i++;
}
i = 0;
while (i < c2) {
cout << "+2";
i++;
}
i = 0;
while (i < c3) {
cout << "+3";
i++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, i, j;
char s[100];
cin >> s;
l = strlen(s);
for (i = 0; i < l; i += 2) {
for (j = 0; j < l - i - 2; j += 2) {
if (s[j] > s[j + 2]) {
swap(s[j], s[j + 2]);
}
}
}
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, i, j, temp, min;
char str[105];
gets(str);
n = strlen(str);
for (i = 0; i < n; i += 2) {
min = i;
for (j = i + 2; j < n; j += 2) {
if (str[min] >= str[j]) {
min = j;
}
}
if (min != i) {
temp = str[min];
str[min] = str[i];
str[i] = temp;
}
}
puts(str);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int i = 1, j, k, minindex;
char str[100], temp, minvalue;
scanf("%s", str);
i = strlen(str);
for (k = 0; k < i; k += 2) {
minvalue = str[k];
minindex = k;
for (j = k; j < i; j += 2) {
if (str[j] < minvalue) {
minvalue = str[j];
minindex = j;
}
}
temp = str[minindex];
str[minindex] = str[k];
str[k] = temp;
}
printf("%s", str);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char arr[101];
int len;
char Temp;
int i;
cin >> arr;
len = strlen(arr);
while (len--)
for (i = 0; i < len; i += 2)
if (arr[i] > arr[i + 2]) {
Temp = arr[i];
arr[i] = arr[i + 2];
arr[i + 2] = Temp;
}
cout << arr << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int dem[5]{0};
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++)
if (s[i] == '+')
dem[0]++;
else
dem[s[i] - '0']++;
for (int i = 1; i <= 3; i++) {
for (int j = 1; j <= dem[i]; j++) {
cout << i;
if (dem[0] > 0) {
cout << "+";
dem[0]--;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int i, n, j;
char a, ch[100];
gets(ch);
n = strlen(ch);
if (n == 1) {
puts(ch);
return 0;
}
for (i = 0; i < n - 1; i += 2) {
for (j = 0; j < n - i - 1; j += 2) {
if (ch[j] > ch[j + 2]) {
a = ch[j + 2];
ch[j + 2] = ch[j];
ch[j] = a;
}
}
}
puts(ch);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
string s1;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] != '+') {
s1.push_back(s[i]);
}
}
sort(s1.begin(), s1.end());
for (int i = 0; i < s1.size() - 1; i++) {
cout << s1[i] << "+";
}
cout << s1[s1.size() - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void quicksort(string& a, int beg, int end) {
if (beg >= end) return;
int p = a[(beg + end) / 2];
int i = beg;
int j = end;
while (i <= j) {
while (a[i] < p) ++i;
while (a[j] > p) --j;
if (i <= j) swap(a[i++], a[j--]);
}
quicksort(a, beg, j);
quicksort(a, i, end);
}
int main() {
string s;
cin >> s;
string numbers;
for (int i = 0; i < s.size(); i += 2) numbers.push_back(s[i]);
quicksort(numbers, 0, numbers.size() - 1);
for (int i = 0; i < numbers.size() - 1; ++i) cout << numbers[i] << '+';
cout << numbers[numbers.size() - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char op[100], temp;
cin >> op;
if (strlen(op) == 1) {
cout << op << endl;
return 0;
}
for (int j = 0; j < strlen(op) - 2; j += 2) {
for (int i = 0; i < strlen(op) - 2; i += 2) {
if (op[i] > op[i + 2]) {
temp = op[i];
op[i] = op[i + 2];
op[i + 2] = temp;
}
}
}
cout << op << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main(void) {
char s[101];
if (scanf("%s", s) != 1) {
return -1;
}
int u = 0, d = 0, t = 0;
for (size_t k = 0; k < strlen(s); k += 2) {
switch (s[k]) {
case '1':
u++;
break;
case '2':
d++;
break;
case '3':
t++;
break;
default:
break;
}
}
int tt = u + d + t;
while (tt > 0) {
if (u > 0) {
printf("1");
u--;
} else if (d > 0) {
printf("2");
d--;
} else if (t > 0) {
printf("3");
t--;
}
if (tt > 1) {
printf("+");
}
tt--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a;
vector<int> mas;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] > 47 && s[i] < 58) {
a = s[i];
a = a - 48;
mas.push_back(a);
}
}
sort(mas.begin(), mas.end());
for (int i = 0; i < mas.size() - 1; i++) cout << mas[i] << "+";
cout << mas[mas.size() - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char c;
int num[100], ind = 0;
while (cin >> c) {
if (isdigit(c)) {
int e = c - '0';
num[ind++] = e;
}
}
sort(num, num + ind);
for (int i = 0; i < ind; i++) {
cout << num[i];
if (i < ind - 1) cout << '+';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l;
string s;
cin >> s;
sort(s.begin(), s.end());
l = s.size() / 2;
for (; l < s.size() - 1; l++) {
cout << s[l] << '+';
}
cout << s[s.size() - 1];
}
|
#include <bits/stdc++.h>
int main() {
int a[100];
char s[100], i, k = 0, j, temp;
scanf("%s", s);
for (i = 0; i < strlen(s); i += 2) a[k++] = (int)(s[i] - '0');
for (i = 0; i < k; i++)
for (j = (i + 1); j < k; j++) {
if (a[i] >= a[j]) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
k = 0;
for (i = 1; i < strlen(s); i += 2) {
printf("%d%c", a[k], s[i]);
k++;
}
printf("%d", a[k]);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char str[105];
int i, j, k, l, num1[1000];
gets(str);
for (i = 0; str[i] != '\0'; i++) {
if (i % 2 == 0) {
num1[i] = str[i] - 48;
}
}
for (i = 0; i <= strlen(str); i += 2) {
for (j = i + 2; j <= strlen(str); j += 2) {
if (num1[i] > num1[j]) {
int temp = num1[i];
num1[i] = num1[j];
num1[j] = temp;
}
}
printf("%d", num1[i]);
if (i == strlen(str) - 1) {
break;
}
printf("+");
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
long long int n1 = 0, n2 = 0, n3 = 0;
long long int m1 = 0, m2 = 0, m3 = 0;
cin >> s;
for (long long int i = 0; i < s.size(); i++) {
if (s[i] == '1') n1 += 1;
if (s[i] == '2') n2 += 1;
if (s[i] == '3') n3 += 1;
}
m1 = n1;
m2 = n2;
m3 = n3;
if (m1 > 0) {
cout << "1";
n1--;
}
while (n1--) {
cout << "+1";
}
if (m2 > 0 && m1 == 0) {
cout << "2";
n2--;
}
if (m2 > 0 && m1 > 0) {
cout << "+2";
n2--;
}
while (n2--) {
cout << "+2";
}
if (m3 > 0 && (m2 == 0 && m1 == 0)) {
cout << "3";
n3--;
}
if (m3 > 0 && (m2 > 0 || m1 > 0)) {
cout << "+3";
n3--;
}
while (n3--) {
cout << "+3";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int num[4] = {0}, len, n = 0;
len = s.size();
for (int i = 0; i < len; i++) {
if (s[i] == '1' || s[i] == '2' || s[i] == '3') {
num[s[i] - '0']++;
if (n <= s[i] - '0') n = s[i] - '0';
}
}
for (int i = 1; i <= n; i++) {
for (int j = 0; num[i] > 0 && j < num[i]; j++) {
cout << i;
if (i <= 3) {
if (i == n && j == num[i] - 1) break;
cout << "+";
}
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
int a;
char t;
cin >> s;
a = s.length();
if (a == 1) {
cout << s << endl;
return 0;
}
for (int i = 0; i < a; i = i + 2) {
for (int j = i + 2; j < a; j = j + 2) {
if (s[i] > s[j]) {
t = s[i];
s[i] = s[j];
s[j] = t;
}
}
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, ans;
cin >> s;
if (s.size() / sizeof(s[0]) < 2) {
cout << s;
return 0;
}
for (int j = 0; j < s.size(); j++) {
for (int i = 0; i < s.size() - 2; i++) {
if (int(s[i]) > int(s[i + 2])) {
int x = s[i];
s[i] = s[i + 2];
s[i + 2] = x;
}
i++;
}
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[4];
int main() {
ios_base::sync_with_stdio(0);
string str;
int q = 0;
cin >> str;
for (int i = 0; i < str.size(); i++) {
int x = str[i] - '0';
x = max(x, 0);
a[x]++;
if (x != 0) q++;
}
for (int i = 1; i <= 3; i++)
for (int j = 0; j < a[i]; j++) {
if (q == 1)
cout << i;
else
cout << i << "+";
q--;
}
}
|
#include <bits/stdc++.h>
int main() {
char s[100];
int ones = 0, twos = 0, threes = 0, pluses = 0;
scanf("%s", s);
for (int i = 0; i < strlen(s); i++) {
if (s[i] == '1')
ones++;
else if (s[i] == '2')
twos++;
else if (s[i] == '3')
threes++;
else if (s[i] == '+')
pluses++;
}
for (int i = 1; i <= ones; i++) {
printf("1");
if (pluses--) printf("+");
}
for (int i = 1; i <= twos; i++) {
printf("2");
if (pluses--) printf("+");
}
for (int i = 1; i <= threes; i++) {
printf("3");
if (pluses--) printf("+");
}
}
|
#include <bits/stdc++.h>
void swap(char *xp, char *yp) {
char temp = *xp;
*xp = *yp;
*yp = temp;
}
void wypisz(char arr[], int size) {
int i;
for (i = 0; i < size; i++) printf("%c", arr[i]);
printf("\n");
}
int main() {
char matma[100];
int i, j;
scanf("%s", matma);
int l = strlen(matma);
for (i = 0; i < l; i += 2)
for (j = 0; j < l - i - 1; j += 2)
if (matma[j] > matma[j + 2]) swap(&matma[j], &matma[j + 2]);
wypisz(matma, l);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i;
string s;
cin >> s;
sort(s.begin(), s.end());
for (int i = s.size() / 2; i < s.size(); i++) {
if (i == s.size() - 1)
cout << s[i];
else
cout << s[i] << '+';
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF64 = 3e18;
const int mod = (int)1e9 + 7;
long long binp(long long a, long long b) {
if (b == 0) return 1;
long long ans = binp(a, b / 2);
long long tmp = (ans * ans);
if (b % 2) return ((tmp * a));
return ((tmp));
}
void display(vector<long long> v) {
for (auto x : v) cout << x << " ";
cout << "\n";
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string sum;
cin >> sum;
long long n = sum.size();
vector<long long> v;
for (long long i = 0; i < n; i++) {
if (sum[i] == '1' || sum[i] == '2' || sum[i] == '3')
v.push_back(sum[i] - '0');
}
long long m = v.size();
sort(v.begin(), v.end());
for (long long j = 0; j < m - 1; j++) cout << v[j] << "+";
cout << v[m - 1] << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
for (int j = 2; j < a.length(); ++j) {
if (a[j] == '+') continue;
int key = int(a[j]);
int i = j - 2;
while (i >= 0 && int(a[i]) > key) {
a[i + 2] = a[i];
i -= 2;
}
a[i + 2] = key;
}
cout << a;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n[3] = {0, 0, 0}, first = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); i += 2) {
++n[s[i] - '1'];
}
if (n[0]) {
cout << '1';
++first;
--n[0];
}
if (n[1] && !first) {
cout << '2';
++first;
--n[1];
}
if (n[2] && !first) {
cout << '3';
--n[2];
}
for (int i = 0; i < 3; ++i) {
for (int o = 0; o < n[i]; ++o) {
cout << '+' << i + 1;
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
string str = "";
for (char ch : s)
if (ch != '+') str += ch;
sort(str.begin(), str.end());
for (int i = 0; i < str.size(); i++) {
if (i == str.size() - 1)
cout << str[i];
else
cout << str[i] << "+";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<char> v;
for (int i = 0; i < s.size(); i++) {
v.push_back((s[i]));
i++;
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
if (i == v.size() - 1) {
cout << v[i];
continue;
}
cout << v[i] << "+";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int j = 0;
char a[100];
for (int i = 0; s[i] != '\0'; i++) {
if (s[i] != '+') {
a[j] = s[i];
j++;
}
}
sort(a, a + j);
for (int i = 0; i < j; i++) {
if (i == j - 1)
cout << a[i] << endl;
else
cout << a[i] << "+";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int h[111];
int main() {
string s;
cin >> s;
int j = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1') {
h[j] = 1;
j++;
} else if (s[i] == '2') {
h[j] = 2;
j++;
} else if (s[i] == '3') {
h[j] = 3;
j++;
} else {
continue;
}
}
sort(h, h + j);
int p = 0;
for (int i = 0; i < j; i++) {
if (p) {
cout << "+";
}
p++;
cout << h[i];
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int arr[4] = {0};
for (int i = 0; i < str.length(); i += 2) {
arr[str[i] - 48]++;
}
int i = 0;
for (int i = 0; i < str.length(); i += 2) {
if (arr[1] != 0) {
str[i] = '1';
arr[1]--;
} else if (arr[2] != 0) {
str[i] = '2';
arr[2]--;
} else if (arr[3] != 0) {
str[i] = '3';
arr[3]--;
}
}
cout << str;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
char a;
int b, c, d, i, k, n;
int main() {
cin >> s;
k = s.size();
if (k < 2) d = 1;
while (n < 100 && d == 0) {
while (i < k - 2 && d == 0) {
if (s[i] > s[i + 2]) {
a = s[i + 2];
s[i + 2] = s[i];
s[i] = a;
}
i += 2;
}
n++;
i = 0;
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int main() {
cin >> s;
n = s.length();
sort(s.begin(), s.end());
for (int i = (n / 2); i < n; i++) {
cout << s[i];
if (i < n - 1) cout << '+';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
vector<int> nums;
getline(cin, s);
for (int i = 0; i < s.length(); ++i) {
if (s[i] != '+') {
nums.push_back(s[i] - '0');
}
}
sort(nums.begin(), nums.end());
for (int i = 0; i < nums.size() - 1; ++i) {
cout << nums[i] << '+';
}
cout << nums[nums.size() - 1];
}
|
#include <bits/stdc++.h>
int main() {
char s[100], temp;
scanf("%s", s);
int l = strlen(s);
for (int i = 0; i < l; i += 2) {
for (int j = 0; j < l - i - 2; j += 2) {
if (s[j] > s[j + 2]) {
temp = s[j];
s[j] = s[j + 2];
s[j + 2] = temp;
}
}
}
printf("%s\n", s);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a[51], i;
cin >> s;
int n = s.length();
for (i = 0; i < n; i = i + 2) {
a[i / 2] = s[i] - '0';
}
sort(a, a + i / 2);
n = i / 2;
cout << a[0];
for (i = 1; i < n; i++) {
cout << "+";
cout << a[i];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.length() > 1) {
vector<int> nums;
for (char c : s)
if (c != '+') nums.push_back(int(c) - 48);
sort(nums.begin(), nums.end());
string ans = "";
for (int i = 0; i < nums.size(); i++) {
ans += to_string(nums[i]);
if (i < nums.size() - 1) ans += "+";
}
cout << ans << endl;
} else
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
int32_t main() {
string str;
cin >> str;
long long l = str.length();
long long i;
vector<long long> v;
for (i = 0; i < l; i = i + 2) v.push_back(str[i]);
sort(v.begin(), v.end());
for (i = 0; i < v.size() - 1; i++) {
cout << v[i] - 48 << "+";
}
cout << v[v.size() - 1] - 48;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int a[4] = {0};
for (int i = 0; i < s.length(); i++) {
if (s[i] == '1')
a[1]++;
else if (s[i] == '2')
a[2]++;
else if (s[i] == '3')
a[3]++;
}
int f = 0;
for (int i = 1; i <= 3; i++) {
if (a[i]) {
for (int j = 1; j <= a[i]; j++) {
if (f == 0 && j == 1) {
cout << i;
f = 1;
} else
cout << "+" << i;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int i, l, j;
cin >> s;
l = s.size();
for (i = 0; i < l; i = i + 2) {
for (j = 0; j < l - i - 2; j = j + 2) {
if (s[j] > s[j + 2]) swap(s[j], s[j + 2]);
}
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
sort(a.begin(), a.end());
for (int i = a.size() / 2; i < a.size() - 1; i++) cout << a[i] << "+";
cout << a[a.size() - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int j = 0;
sort(s.begin(), s.end());
int l = ((s.size() - 1) / 2);
string b[2 * (s.size() - l)];
for (int i = l; i < s.size(); i++) {
b[2 * j] = s[i];
j++;
}
for (int i = 0; i < s.size(); i++) {
if (i & 1) {
b[i] = "+";
}
}
for (int i = 0; i < s.size(); i++) {
cout << b[i];
}
}
|
#include <bits/stdc++.h>
int main() {
int i, j, len, count = 0, k = 0, val, temp;
char str[110];
gets(str);
len = strlen(str);
for (i = 0; i < len; i++) {
if (str[i] == '1' || str[i] == '2' || str[i] == '3') {
count++;
}
}
int arr[count];
for (i = 0; i < len; i++) {
if (str[i] == '1' || str[i] == '2' || str[i] == '3') {
val = str[i] - 48;
arr[k] = val;
k++;
}
}
for (i = 0; i < count; i++) {
temp = arr[i];
for (j = i; j > 0 && temp < arr[j - 1]; j--) {
arr[j] = arr[j - 1];
}
arr[j] = temp;
}
k = 0;
for (i = 0; i < len; i++) {
if (str[i] == '1' || str[i] == '2' || str[i] == '3') {
str[i] = 48 + arr[k];
k++;
}
}
puts(str);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = (int)s.length();
vector<int> digit;
for (int i = 0; i < n; i += 2) {
digit.emplace_back((int)s[i] - 48);
}
sort(digit.begin(), digit.end());
for (int i = 0; i < (int)digit.size(); i++) {
if (i != (int)digit.size() - 1) {
cout << digit[i] << "+";
} else {
cout << digit[i];
}
}
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int i = 0, j, t, n;
char p[100];
scanf("%s", p);
n = strlen(p);
for (; i < n - 1; i = i + 2) {
for (j = 0; j < n - 1; j = j + 2) {
if (p[j] > p[j + 2]) {
t = p[j];
p[j] = p[j + 2];
p[j + 2] = t;
}
}
}
printf("%s\n", p);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
vector<long long> y;
for (long long i = 0; i < a.size(); i++) {
if (a[i] != '+') y.push_back(a[i] - '0');
}
sort(y.begin(), y.end());
for (long long i = 0; i < y.size() - 1; i++) cout << y[i] << "+";
cout << y[y.size() - 1];
}
|
#include <bits/stdc++.h>
int main() {
int symbols = 0, one = 0, two = 0, three = 0, i;
char s[101], *p;
gets(s);
p = s;
while (*p != '\0') {
if (*p == '1')
one++;
else if (*p == '2')
two++;
else if (*p == '3')
three++;
else if (*p == '+')
symbols++;
*p++;
}
for (i = 0; i < one; i++) {
printf("1");
if (symbols) {
printf("+");
symbols--;
}
}
for (i = 0; i < two; i++) {
printf("2");
if (symbols) {
printf("+");
symbols--;
}
}
for (i = 0; i < three; i++) {
printf("3");
if (symbols) {
printf("+");
symbols--;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.length() == 1)
cout << s << endl;
else {
s.erase(remove(s.begin(), s.end(), '+'), s.end());
sort(s.begin(), s.end());
for (int i = 0; i < s.length() - 1; i++) {
cout << s[i] << '+';
}
cout << s[s.length() - 1];
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> n;
for (size_t i = 0; i < s.size(); i += 2) {
n.push_back((int)(s[i]) - 48);
}
for (size_t i = 0; i < n.size() - 1; i++) {
for (size_t j = 0; j < n.size() - i - 1; j++) {
if (n[j] > n[j + 1]) {
int temp = n[j];
n[j] = n[j + 1];
n[j + 1] = temp;
}
}
}
cout << n[0];
for (size_t i = 1; i < n.size(); i++) {
cout << "+" << n[i];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
char a[100];
cin >> s;
int j = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] != '+') {
a[j] = s[i];
j++;
}
}
sort(a, a + j);
for (int i = 0; i < j; i++) {
if (i == j - 1)
cout << a[i] << endl;
else
cout << a[i] << "+";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[105], i, j;
char c;
for (i = 0; i <= 105; i++) {
scanf("%d", &a[i]);
c = getchar();
if (c == '\n') break;
}
sort(a, a + i + 1);
for (j = 0; j < 1 + i; j++) {
if (j == 0)
printf("%d", a[j]);
else
printf("+%d", a[j]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char str[100];
int num[3];
memset(num, 0, sizeof(num));
scanf("%s", str);
int len = 0;
len = strlen(str);
for (int i = 0; i < len; i++) {
if (str[i] == '1')
num[0]++;
else if (str[i] == '2')
num[1]++;
else if (str[i] == '3')
num[2]++;
}
char ans[len];
memset(ans, '/0', sizeof(ans));
for (int i = 0; i < len - 1; i = i + 2) {
ans[i + 1] = '+';
for (int i = 2 * (num[0] + num[1]); i < num[0] + num[1] + num[2]; i++) {
ans[2 * i] = '2';
}
}
for (int i = 0; i < num[0]; i++) {
ans[2 * i] = '1';
}
for (int i = num[0]; i < (num[0] + num[1]); i++) {
ans[2 * i] = '2';
}
for (int i = (num[0] + num[1]); i < (num[0] + num[1] + num[2]); i++) {
ans[2 * i] = '3';
}
for (int i = 0; i < len; i++) {
printf("%c", ans[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char a[100];
cin >> a;
int i, temp;
int j = 0;
while (a[j] != '\0') {
i = 0;
while (a[i] != '\0') {
if (a[i + 1] != '\0') {
if (a[i] > a[i + 2]) {
temp = a[i];
a[i] = a[i + 2];
a[i + 2] = temp;
}
}
i += 2;
}
j += 2;
}
cout << a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4;
int arr[N], sum[N];
void solve() {
string s;
cin >> s;
vector<int> v;
for (int i = 0; i < s.length(); ++i) {
if (s[i] != '+') v.push_back(s[i] - '0');
}
sort(v.begin(), v.end());
int n = v.size();
for (int i = 0; i < n; ++i) {
cout << to_string(v[i]);
if (i != n - 1) cout << '+';
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[101];
int i, flag, c1, c2, c3, l;
while (cin >> s) {
c1 = 0;
c2 = 0;
c3 = 0;
for (i = 0, l = strlen(s); i < l; i += 2) {
if (s[i] == '1')
c1++;
else if (s[i] == '2')
c2++;
else
c3++;
}
flag = 0;
for (i = 0; i < c1; i++) {
if (flag) cout << "+";
cout << "1";
flag = 1;
}
for (i = 0; i < c2; i++) {
if (flag) cout << "+";
cout << "2";
flag = 1;
}
for (i = 0; i < c3; i++) {
if (flag) cout << "+";
cout << "3";
flag = 1;
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int one = 0, two = 0, three = 0;
for (int i = 0; i < str.length(); i += 2) {
if ((str[i] - '0') == 1) {
one += 1;
} else if ((str[i] - '0') == 2) {
two += 1;
} else if ((str[i] - '0') == 3) {
three += 1;
}
}
for (int i = 0; i < str.length(); i += 2) {
if (one > 0) {
str[i] = '1';
one--;
} else if (two > 0) {
str[i] = '2';
two--;
} else if (three > 0) {
str[i] = '3';
three--;
}
}
cout << str;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string add;
char temp;
int i, len, sum, j;
cin >> add;
len = add.length();
sum = (len - 1) / 2;
for (i = 0; i < sum; i++) {
for (j = 0; j < len - 2; j += 2) {
if (add[j] > add[j + 2]) {
temp = add[j];
add[j] = add[j + 2];
add[j + 2] = temp;
}
}
}
cout << add << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[1000], n = 0;
while (cin >> a[n++])
;
sort(a, a + n);
cout << a[1];
for (int i = 2; i < n; i++) cout << '+' << a[i];
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char inp[1000];
int one = 0, two = 0, three = 0, plus = 0;
scanf("%s", inp);
for (int i = 0; i < strlen(inp); i++) {
if (inp[i] == '1') {
one++;
} else if (inp[i] == '2') {
two++;
} else if (inp[i] == '3') {
three++;
} else if (inp[i] == '+') {
plus++;
}
}
for (int i = 0; i < strlen(inp); i++) {
if (i % 2 != 0) {
printf("+");
} else if (one > 0) {
printf("1");
one--;
} else if (two > 0) {
printf("2");
two--;
} else if (three > 0) {
printf("3");
three--;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c;
vector<int> d;
while (cin >> c) {
d.push_back(c);
}
sort(d.begin(), d.end());
cout << d[0];
for (int i = 1; i < d.size(); ++i) {
cout << "+" << d[i];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long len = s.length();
for (int i = 0; i < len - 1; i += 2) {
for (int j = 0; j < len - 2 - i; j++) {
if (s[j] > s[j + 2]) swap(s[j], s[j + 2]);
}
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
string st;
vector<long> v;
long r;
int main() {
ios_base::sync_with_stdio(0);
cin >> st;
st += '+';
for (int i = 0; i < st.size(); i++) {
if (st[i] == '+') {
v.push_back(r);
r = 0;
} else
r = r * 10 + st[i] - 48;
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
if (i) cout << "+";
cout << v[i];
}
cout << endl;
cin.get();
cin.get();
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char st[100];
int len = 0, i, j, temp = 0;
scanf("%s", st);
len = strlen(st);
for (i = 0; i < len; i += 2) {
for (j = 0; j < len - 1; j += 2) {
if (st[j] > st[j + 2]) {
temp = st[j];
st[j] = st[j + 2];
st[j + 2] = temp;
}
}
}
printf("%s", st);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int c1 = 0, c2 = 0, c3 = 0, a;
cin >> s;
for (int i = 0; i < s.length(); i = i + 2) {
a = (s[i]);
if (a == '1') c1++;
if (a == '2') c2++;
if (a == '3') c3++;
}
while (1) {
if (c1) {
cout << '1';
c1--;
if (c1 + c2 + c3 == 0)
break;
else
cout << '+';
continue;
}
if (c2) {
cout << '2';
c2--;
if (c1 + c2 + c3 == 0)
break;
else
cout << '+';
continue;
}
if (c3) {
cout << '3';
c3--;
if (c1 + c2 + c3 == 0)
break;
else
cout << '+';
continue;
}
}
}
|
#include <bits/stdc++.h>
int main() {
int i, j = 1, x, k = 0;
int c, y;
int ar[1000];
char str[500];
scanf("%s", str);
for (i = 0; str[i] != '\0'; i++) {
x = isdigit(str[i]);
if (x != 0) {
ar[j] = str[i];
j++;
k++;
}
}
int pass;
for (pass = 1; pass <= k; pass++) {
for (j = 1; j <= k - 1; j++) {
if (ar[j] > ar[j + 1]) {
c = ar[j];
ar[j] = ar[j + 1];
ar[j + 1] = c;
}
}
}
j = 1;
for (i = 0; str[i] != '\0'; i++) {
y = isdigit(str[i]);
{
if (y != 0) {
str[i] = ar[j];
j++;
}
}
}
printf("%s", str);
}
|
#include <bits/stdc++.h>
using namespace std;
int uz[4];
int main() {
string s;
int c;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] > 48 && s[i] < 52) {
uz[s[i] - 48]++;
}
}
c = uz[1];
int d = uz[2];
while (uz[1]) {
cout << 1;
uz[1]--;
if (uz[1] != 0) {
cout << "+";
}
}
if (uz[2] != 0 && c != 0) cout << "+";
while (uz[2]) {
cout << 2;
uz[2]--;
if (uz[2] != 0) {
cout << "+";
}
}
bool z = 0;
if (d != 0 || c != 0) z = 1;
if (uz[3] != 0 && z) cout << "+";
while (uz[3]) {
cout << 3;
uz[3]--;
if (uz[3] != 0) {
cout << "+";
}
}
}
|
#include <bits/stdc++.h>
int main() {
char b[100], c[100];
int i, j;
gets(b);
j = 0;
for (i = 0; b[i] != '\0'; i++) {
if (b[i] == '1' || b[i] == '2' || b[i] == '3') {
c[j] = b[i];
j++;
}
}
c[j] = '\0';
int d = j - 1;
int k, l;
char temp;
for (k = 0; k < j - 1; k++) {
for (l = 0; l < j - 1 - k; l++) {
if (c[l] > c[l + 1]) {
temp = c[l + 1];
c[l + 1] = c[l];
c[l] = temp;
}
}
}
for (j = 0; j <= d; j++) {
if (j > 0) printf("+");
printf("%c", c[j]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
char temp;
for (int i = 0; i < s.length(); i++) {
for (int j = i; j < s.length(); j++) {
if (s[i] == '3' && s[j] == '1' || s[i] == '3' && s[j] == '2' ||
s[i] == '2' && s[j] == '1') {
temp = s[i];
s[i] = s[j];
s[j] = temp;
}
}
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i += 2)
for (int j = 0; j < s.size() - 1; j += 2) {
if (s[i] <= s[j + 2]) {
swap(s[i], s[j + 2]);
}
}
if (s.size() > 1) {
for (int i = 2; i < s.size(); i++) cout << s[i];
cout << s[1] << s[0] << endl;
} else
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const int N = 1e4 + 10;
const int V = 1e5;
const long long int E = 4LL * V * V;
int Count[4];
int main() {
string s;
cin >> s;
int n = s.size();
for (int i = 0; i < (n); ++i) {
Count[s[i] - '0']++;
i++;
}
if (Count[1] > 0) {
printf("1");
Count[1]--;
} else {
if (Count[2] > 0) {
printf("2");
Count[2]--;
} else {
Count[3]--;
printf("3");
}
}
for (int i = 0; i < (Count[1]); ++i) {
printf("+1");
}
for (int i = 0; i < (Count[2]); ++i) {
printf("+2");
}
for (int i = 0; i < (Count[3]); ++i) {
printf("+3");
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int k1 = 0, k2 = 0, k3 = 0;
string s;
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 49) k1++;
if (s[i] == 50) k2++;
if (s[i] == 51) k3++;
}
if (k1 == 1 && k2 == 0 && k3 == 0) {
cout << 1;
return 0;
}
if (k1 == 0 && k2 == 1 && k3 == 0) {
cout << 2;
return 0;
}
if (k1 == 0 && k2 == 0 && k3 == 1) {
cout << 3;
return 0;
}
int kn1 = k1, kn2 = k2, kn3 = k3;
while (k1 > 0) {
if (kn1 == 1) {
cout << 1;
break;
}
if (k1 == 1) {
cout << 1;
break;
}
cout << 1 << "+";
k1--;
}
while (k2 > 0) {
if (kn1 == 0) {
cout << 2;
kn1++;
k2--;
continue;
}
if (kn2 == 1) {
cout << "+2";
break;
}
if (k2 == 1) {
cout << "+2";
break;
}
cout << "+" << 2;
k2--;
}
while (k3 > 0) {
if (kn1 == 0 && kn2 == 0) {
cout << 3;
kn1++;
kn2++;
k3--;
continue;
}
if (kn3 == 1) {
cout << "+3";
break;
}
if (k3 == 1) {
cout << "+3";
break;
}
cout << "+" << 3;
k3--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int j = 0;
for (int i = 0; i < n; i++) {
if (i % 2 != 0) {
s[i] = ' ';
}
}
sort(s.begin(), s.end());
for (int i = 0; i < n - 1; i++) {
if (s[i] != ' ') cout << s[i] << "+";
}
cout << s[n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[110], c;
int i, j;
cin >> s;
for (i = 0; i < strlen(s); i += 2) {
for (j = i + 2; j < strlen(s); j += 2) {
if (s[i] > s[j]) {
c = s[i];
s[i] = s[j];
s[j] = c;
}
}
}
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a1 = 0;
int a2 = 0;
int a3 = 0;
string s;
cin >> s;
for (int i = 0; i < s.length(); i += 2) {
if (s[i] - 48 == 1) a1 += 1;
if (s[i] - 48 == 2) a2 += 1;
if (s[i] - 48 == 3) a3 += 1;
}
if (a1 != 0) {
cout << 1;
a1--;
} else if (a2 != 0) {
a2--;
cout << 2;
} else {
a3--;
cout << 3;
}
for (int i = 0; i < a1; i++) cout << '+' << 1;
for (int i = 0; i < a2; i++) cout << '+' << 2;
for (int i = 0; i < a3; i++) cout << '+' << 3;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string c;
cin >> c;
vector<char> v;
for (int i = 0; i < c.size(); i++) {
if (c[i] == '+') continue;
v.push_back(c[i]);
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size() - 1; i++) printf("%d+", v[i] - 48);
printf("%d\n", v[v.size() - 1] - 48);
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> arr;
void fill() {
char ch = getchar();
while (ch != '\n') {
if (ch != '+') arr.push_back(ch - '0');
ch = getchar();
}
}
int main() {
fill();
sort(arr.begin(), arr.end());
for (int i = 0; i < arr.size(); ++i) {
cout << arr[i];
if (i != arr.size() - 1) cout << "+";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int x;
x = s.length();
int b[(x / 2) + 1];
for (int i = 0; i < (x / 2) + 1; i++) b[i] = 0;
int j = 0;
for (int i = 0; i < s.length(); i = i + 2) {
b[j] = (s[i] - '0');
j++;
}
sort(b, b + j);
for (int k = 0; k < j; k++) {
cout << b[k];
if (k != j - 1) cout << '+';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string x;
vector<int> n;
int main() {
cin >> x;
int li = x.length(), i;
for (i = 0; i < li; i++) {
if (x[i] == 49 || x[i] == 50 || x[i] == 51) {
n.push_back(x[i]);
}
}
sort(n.begin(), n.end());
int si = n.size();
for (i = 0; i < si; i++) {
if (i == si - 1) {
cout << n[i] - 48;
} else {
cout << n[i] - 48 << "+";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
vector<int> v;
vector<char> h;
vector<char> g;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (i % 2 == 0) {
int x = s[i] - '0';
v.push_back(x);
}
}
for (int i = 0; i < v.size(); i++) {
for (int j = i + 1; j < v.size(); j++) {
if (v[i] > v[j]) {
int y = v[i];
v[i] = v[j];
v[j] = y;
}
}
}
for (int i = 0; i < v.size(); i++) {
char c = v[i] + '0';
h.push_back(c);
}
int count = -1;
for (int j = 0; j < (2 * h.size()) - 1; j++) {
if (j % 2 != 0) {
g.push_back('+');
} else {
g.push_back(h[j - (++count)]);
}
}
for (int j = 0; j < (2 * v.size()) - 1; j++) {
cout << g[j];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
getline(cin, s);
int n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] == '+') continue;
for (int j = 0; j < n; j++) {
if (s[j] == '+') continue;
if (s[i] < s[j]) swap(s[i], s[j]);
}
}
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char s1[100], s2[100];
int i, n = 0, m = 0, k = 0, j, l;
gets(s1);
l = strlen(s1);
for (i = 0; i < l; i++) {
if (s1[i] == 49) {
n++;
}
if (s1[i] == 50) {
m++;
}
if (s1[i] == 51) {
k++;
}
}
bool first = true;
for (j = 0; j < n; j++) {
if (first == true) {
printf("1");
first = false;
} else
printf("+1");
}
for (j = 0; j < m; j++) {
if (first == true) {
printf("2");
first = false;
} else
printf("+2");
}
for (j = 0; j < k; j++) {
if (first == true) {
printf("3");
first = false;
} else
printf("+3");
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
int main() {
char s[101];
int i, j, a, b, count, temp;
gets(s);
int n = strlen(s);
for (i = 0; i < n - 1; i = i + 2) {
for (j = i + 2; j < n; j = j + 2) {
if (s[i] > s[j]) {
temp = s[i];
s[i] = s[j];
s[j] = temp;
}
}
}
printf("%s\n", s);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[1005];
int s2[1005];
while (cin >> s) {
int m = strlen(s), l = 0;
if (m == 1) {
cout << s << endl;
continue;
}
for (int i = 0; i < m; i++) {
if (s[i] != '+') s2[l++] = s[i] - '0';
}
sort(s2, s2 + l);
cout << s2[0];
for (int i = 1; i < l; i++) printf("+%d", s2[i]);
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c[5];
for (int i = 1; i < 4; i++) {
c[i] = 0;
}
char l[105];
scanf(" %s", l);
for (int i = 0; i < (int)strlen(l); i++) {
if (l[i] == '1') {
c[1] = c[1] + 1;
}
if (l[i] == '2') {
c[2] = c[2] + 1;
}
if (l[i] == '3') {
c[3] = c[3] + 1;
}
}
for (int i = 0; i < c[1] + c[2] + c[3]; i++) {
if (i != 0) {
printf("+");
}
if (i < c[1]) {
printf("1");
}
if ((i < c[1] + c[2]) && (i >= c[1])) {
printf("2");
}
if (i >= c[1] + c[2]) {
printf("3");
}
if (i == c[1] + c[2] + c[3] - 1) {
printf("\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char c;
int a[1000];
int n = 0;
while ((c = getchar()) != EOF) {
a[n++] = c - '0';
getchar();
}
sort(a, a + n);
for (int i = 0; i < n; i++) {
printf("%d", a[i]);
if (i != n - 1)
printf("+");
else
printf("\n");
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.