Submission details
Task:Number
Sender:Pietari Kaskela
Submission time:2015-10-07 17:01:01 +0300
Language:C++
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.06 sdetails
#2ACCEPTED0.05 sdetails
#3ACCEPTED0.05 sdetails
#4ACCEPTED0.05 sdetails
#5ACCEPTED0.05 sdetails
#6ACCEPTED0.05 sdetails
#7ACCEPTED0.05 sdetails
#8ACCEPTED0.05 sdetails
#9ACCEPTED0.06 sdetails
#10ACCEPTED0.05 sdetails
#11ACCEPTED0.05 sdetails
#12ACCEPTED0.05 sdetails
#13ACCEPTED0.05 sdetails
#14ACCEPTED0.05 sdetails
#15ACCEPTED0.06 sdetails
#16ACCEPTED0.05 sdetails
#17ACCEPTED0.05 sdetails
#18ACCEPTED0.05 sdetails
#19ACCEPTED0.04 sdetails
#20ACCEPTED0.06 sdetails
#21ACCEPTED0.05 sdetails
#22ACCEPTED0.06 sdetails
#23ACCEPTED0.05 sdetails
#24ACCEPTED0.06 sdetails
#25ACCEPTED0.04 sdetails

Code

#include <bits/stdc++.h>

#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int

#define pii pair<int, int>
#define pll pair<long long, long long>

#define defmod 1000000007
using namespace std;


int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	string s; cin >> s;
	int n = s.length();
	for(int i = 0; i < n-1; i++){
		if(s[i] < s[i+1]){
			cout << s.substr(0, i)+s.substr(i+1, n-(i+1)) << endl;
			return 0;
		}
	}
	cout << s.substr(0, n-1) << endl;
	return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
11

correct output
1

user output
1

Test 2

Verdict: ACCEPTED

input
12

correct output
2

user output
2

Test 3

Verdict: ACCEPTED

input
21

correct output
2

user output
2

Test 4

Verdict: ACCEPTED

input
123

correct output
23

user output
23

Test 5

Verdict: ACCEPTED

input
132

correct output
32

user output
32

Test 6

Verdict: ACCEPTED

input
213

correct output
23

user output
23

Test 7

Verdict: ACCEPTED

input
231

correct output
31

user output
31

Test 8

Verdict: ACCEPTED

input
312

correct output
32

user output
32

Test 9

Verdict: ACCEPTED

input
321

correct output
32

user output
32

Test 10

Verdict: ACCEPTED

input
112

correct output
12

user output
12

Test 11

Verdict: ACCEPTED

input
121

correct output
21

user output
21

Test 12

Verdict: ACCEPTED

input
211

correct output
21

user output
21

Test 13

Verdict: ACCEPTED

input
111

correct output
11

user output
11

Test 14

Verdict: ACCEPTED

input
122

correct output
22

user output
22

Test 15

Verdict: ACCEPTED

input
212

correct output
22

user output
22

Test 16

Verdict: ACCEPTED

input
221

correct output
22

user output
22

Test 17

Verdict: ACCEPTED

input
555555555555555555555555555555...

correct output
555555555555555555555555555555...

user output
555555555555555555555555555555...

Test 18

Verdict: ACCEPTED

input
222222222222222222222222222222...

correct output
222222222222222222222222222222...

user output
222222222222222222222222222222...

Test 19

Verdict: ACCEPTED

input
777777777777777777777777777777...

correct output
777777777777777777777777777777...

user output
777777777777777777777777777777...

Test 20

Verdict: ACCEPTED

input
444444444444444444444444444444...

correct output
444444444444444444444444444444...

user output
444444444444444444444444444444...

Test 21

Verdict: ACCEPTED

input
555555555555555555555555555555...

correct output
555555555555555555555555555555...

user output
555555555555555555555555555555...

Test 22

Verdict: ACCEPTED

input
122222222222222222222222222222...

correct output
222222222222222222222222222222...

user output
222222222222222222222222222222...

Test 23

Verdict: ACCEPTED

input
222222222222222222222222222222...

correct output
222222222222222222222222222222...

user output
222222222222222222222222222222...

Test 24

Verdict: ACCEPTED

input
322222222222222222222222222222...

correct output
322222222222222222222222222222...

user output
322222222222222222222222222222...

Test 25

Verdict: ACCEPTED

input
222222222222222222222222222222...

correct output
222222222222222222222222222222...

user output
222222222222222222222222222222...