QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#58190 | #2910. Rise and Fall | Beevo# | WA | 5ms | 3636kb | C++23 | 568b | 2022-10-25 01:51:43 | 2022-10-25 01:51:45 |
Judging History
answer
#include <bits/stdc++.h>
#define el '\n'
#define ll long long
#define ld long double
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
void testCase() {
string s;
cin >> s;
int n = s.size();
int i;
for (i = 1; i < n; i++) {
if (s[i] < s[i - 1])
break;
}
for (i++; i < n; i++)
s[i] = s[i - 1];
cout << s << el;
}
signed main() {
Beevo
int T = 1;
cin >> T;
while (T--)
testCase();
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 5ms
memory: 3636kb
input:
22221 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 10...
output:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 100 100 ...
result:
wrong answer 210th lines differ - expected: '210', found: '211'