Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
153303 Kevin 分割排序 C++ Wrong Answer 0 MS 276 KB 729 2026-05-14 15:34:49

Tests(0/1):

Code:

#include<bits/stdc++.h> using namespace std; int main() { int n; cin >> n; while (n--) { int a[10000] = {0}; int sum = 0; string s; cin >> s; int len = s.size(); int j = 0; for (int i = 0; i < len; i++) { if (s[i] != '5') { sum = sum * 10 + (s[i] - '0'); } else { // 只要不是连续 5，就存数（0 也要存） a[j++] = sum; sum = 0; } } // 把最后一段存进去 a[j++] = sum; // 冒泡排序 for (int i = 0; i < j-1; i++) { for (int z = i+1; z < j; z++) { if (a[i] > a[z]) { swap(a[i], a[z]); } } } // 输出 for (int i = 0; i < j; i++) { cout << a[i] << " "; } cout << endl; } return 0; }

Run Info:

------Input------

00000000000000000000000
1234567890987654321
00025158595675234050
56789512345500050059854321
55555123532
00005555987651234515253540500
98751000000005999999995123134500000555346785
000000055555555
00000005555555555550000000000000000
1515151515151515151
555555555500000000000
5555555555500000000000005555555555555555555
12354675789
1234678955555555555098765550001234
12346789
55555555511111111
99999995
12350987655555512
985211
123456789051234567890512345678905123456789051234567890512345678905123456789
------Answer-----

0
1234 4321 678909876
0 1 2 8 9 67 2340
0 0 98 1234 4321 6789
32 123
0 0 1 2 3 40 1234 9876
0 987 34678 123134 99999999 100000000
0
0 0
1 1 1 1 1 1 1 1 1 1
0
0
123 467 789
1234 9876 12346789
12346789
11111111
9999999
12 123 9876
98 211
1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234 1234
------Your output-----