QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#56458 | #2910. Rise and Fall | Silverhorse7# | WA | 70ms | 3520kb | C++ | 385b | 2022-10-19 17:32:50 | 2022-10-19 17:33:07 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
signed main() {
int T;
cin >> T;
while (T--) {
string s;
cin >> s;
string t;
t += s[0];
int X = 1;
while (X < s.size() and s[X] > s[X - 1])
t += s[X++];
while (t.size() < s.size())
t += s[X];
cout << t << endl;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 70ms
memory: 3520kb
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 110th lines differ - expected: '110', found: '111'