QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#58190#2910. Rise and FallBeevo#WA 5ms3636kbC++23568b2022-10-25 01:51:432022-10-25 01:51:45

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-10-25 01:51:45]
  • 评测
  • 测评结果：WA
  • 用时：5ms
  • 内存：3636kb
查看
  • [2022-10-25 01:51:43]
  • 提交

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;
}
Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

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'
English 繁體中文 简体中文

Server Time: 2024-12-02 07:07:43 | OpenSource Project