/*********************************************************************
程序名:
日期: 2026-02-07 14:39
说明:
*********************************************************************/
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, a, b, c, d, e, t;
cin >> x;
a = x % 10;
b = x / 10 % 10;
c = x / 100 % 10;
d = x / 1000 % 10;
e = x / 10000;
if (1) { //将a设为最大值
if (a > b) {
t = a;
a = b;
b = t;
}
if (a > c) {
t = a;
a = c;
c = t;
}
if (a > d) {
t = a;
a = d;
d = t;
}
if (a > e) {
t = a;
a = e;
e = t;
}
}
if (1) { //将b设为第二大的值
if (a < b) {
t = a;
a = b;
b = t;
}
if (b > c) {
t = b;
b = c;
c = t;
}
if (b > d) {
t = b;
b = d;
d = t;
}
if (b > e) {
t = b;
b = e;
e = t;
}
}
if (1) { //将c设为第三大的值
if (a < c) {
t = a;
a = c;
c = t;
}
if (b < c) {
t = c;
c = b;
b = t;
}
if (c > d) {
t = c;
c = d;
d = t;
}
if (a > e) {
t = c;
c = e;
e = t;
}
}
if (1) { //将d设为第四大的值
if (a < d) {
t = a;
a = d;
d = t;
}
if (b < d) {
t = d;
d = b;
b = t;
}
if (c < d) {
t = c;
c = d;
d = t;
}
if (e > d) {
t = d;
d = e;
e = t;
}
}
if (1) { //将e设为最小值
if (a < e) {
t = a;
a = e;
e = t;
}
if (b < e) {
t = e;
e = b;
b = t;
}
if (c < e) {
t = c;
c = e;
e = t;
}
if (e > d) {
t = d;
d = e;
e = t;
}
}
cout << a << b << c << d << e;
return 0;
}
5 条评论
-
zhuyuebin @ 2026-3-4 14:28:46
#include <bits/stdc++.h> using namespace std; int main() { char s[1000000]; cin>>s; int a[1000000]; int len=strlen(s); for(int i=0;i<len;i++)a[i]=s[i]-'0'; for(int i=0;i<len;i++){ for(int j=0;j<len;j++){ if(a[j]<a[i])swap(a[j],a[i]); } } for(int i=0;i<len;i++)cout<<a[i]; return 0; }//位数是一百万位以内的数从大到小输出 -
@ 2026-3-4 14:20:11
#include <bits/stdc++.h> using namespace std; int main() { char s[1000000]; cin>>s; int a[1000000]; int len=strlen(s); for(int i=0;i<len;i++)a[i]=s[i]-'0'; for(int i=0;i<len;i++){ for(int j=0;j<len;j++){ if(a[j]<a[i])swap(a[j],a[i]); } } for(int i=0;i<len;i++)cout<<a[i]; return 0; }
-
@ 2026-3-4 14:19:14
#include <bits/stdc++.h> using namespace std; int main() { char s[1000000]; cin>>s; int a[1000000]; int len=strlen(s); for(int i=0;i<len;i++)a[i]=s[i]-'0'; for(int i=0;i<len;i++){ for(int j=0;j<len;j++){ if(a[j]<a[i])swap(a[j],a[i]); } } for(int i=0;i<len;i++)cout<<a[i]; return 0; }//位数是一百万位以内的数字从大到小排序输出
-
@ 2026-3-4 14:02:45
你真的很有耐心
-
@ 2026-3-4 14:00:33
125行代码！！！
- 1
