Submission details
Task:Number
Sender:Häviö Life
Submission time:2015-10-07 16:50:34 +0300
Language:C++
Status:READY
Result:
Test results
testverdicttime
#10.06 sdetails
#20.05 sdetails
#30.05 sdetails
#40.06 sdetails
#50.05 sdetails
#60.06 sdetails
#70.05 sdetails
#80.06 sdetails
#90.05 sdetails
#100.06 sdetails
#110.05 sdetails
#120.05 sdetails
#130.06 sdetails
#140.06 sdetails
#150.06 sdetails
#160.05 sdetails
#170.14 sdetails
#180.13 sdetails
#190.14 sdetails
#200.14 sdetails
#210.13 sdetails
#220.13 sdetails
#230.15 sdetails
#240.15 sdetails
#250.15 sdetails

Code

#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <unordered_set>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <fstream>
#include <set>
#include <map>

#define MOD 1000000007
#define ll long long
#define N (1<<50)
#define float double
#define str string

using namespace std;


int main(){
    int n;
    cin>>n;
    string s;
    cin>>s;

    int poistettava=-1;
    for(int i=0; i<n-1; i++)
        if(s[i]<s[i+1]){
            poistettava=i;
            break;
        }

    if(poistettava==-1)
        poistettava=n-1;

    for(int i=0; i<n; i++)
        if(i!=poistettava)
            cout<<s[i];
    cout<<endl;
    return 0;
}

Test details

Test 1

Verdict:

input
11

correct output
1

user output

Test 2

Verdict:

input
12

correct output
2

user output

Test 3

Verdict:

input
21

correct output
2

user output

Test 4

Verdict:

input
123

correct output
23

user output
...

Test 5

Verdict:

input
132

correct output
32

user output
...

Test 6

Verdict:

input
213

correct output
23

user output
...

Test 7

Verdict:

input
231

correct output
31

user output
...

Test 8

Verdict:

input
312

correct output
32

user output
...

Test 9

Verdict:

input
321

correct output
32

user output
...

Test 10

Verdict:

input
112

correct output
12

user output
...

Test 11

Verdict:

input
121

correct output
21

user output
...

Test 12

Verdict:

input
211

correct output
21

user output
...

Test 13

Verdict:

input
111

correct output
11

user output
...

Test 14

Verdict:

input
122

correct output
22

user output
...

Test 15

Verdict:

input
212

correct output
22

user output
...

Test 16

Verdict:

input
221

correct output
22

user output
...

Test 17

Verdict:

input
555555555555555555555555555555...

correct output
555555555555555555555555555555...

user output
(empty)

Test 18

Verdict:

input
222222222222222222222222222222...

correct output
222222222222222222222222222222...

user output
(empty)

Test 19

Verdict:

input
777777777777777777777777777777...

correct output
777777777777777777777777777777...

user output
(empty)

Test 20

Verdict:

input
444444444444444444444444444444...

correct output
444444444444444444444444444444...

user output
(empty)

Test 21

Verdict:

input
555555555555555555555555555555...

correct output
555555555555555555555555555555...

user output
(empty)

Test 22

Verdict:

input
122222222222222222222222222222...

correct output
222222222222222222222222222222...

user output
(empty)

Test 23

Verdict:

input
222222222222222222222222222222...

correct output
222222222222222222222222222222...

user output
(empty)

Test 24

Verdict:

input
322222222222222222222222222222...

correct output
322222222222222222222222222222...

user output
(empty)

Test 25

Verdict:

input
222222222222222222222222222222...

correct output
222222222222222222222222222222...

user output
(empty)