-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path208B.cpp
More file actions
62 lines (52 loc) · 1.44 KB
/
208B.cpp
File metadata and controls
62 lines (52 loc) · 1.44 KB
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
// Rodrigo Farias de Macêdo
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define SZ(S) ((int) ((S).size()))
#define DEBUG(x) { cout << #x << " = " << x << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
string s;
void melhorPior(){
FORD(i, SZ(s)-2, 0){
if((s[i] - '0') % 2 == 0){
char temp = s[i];
s[i] = s[SZ(s)-1];
s[SZ(s)-1] = temp;
break;
}
}
}
void piorMelhor(){
int ui = s[SZ(s) - 1] - '0';
bool flag = false;
FOR(i, 0, SZ(s)-1){
if((s[i] - '0') % 2 == 0 && (s[i]-'0') < ui) {
char temp = s[i];
s[i] = s[SZ(s)-1];
s[SZ(s)-1] = temp;
flag = true;
break;
}
}
if(!flag) melhorPior();
}
int main(){
ios :: sync_with_stdio(false);
cin >> s;
int j = 0;
while((s[j] - '0')%2 == 1){
j++;
}
if(j >= SZ(s) -1 ){
cout << -1 << endl;
}else{
piorMelhor();
cout << s << endl;
}
return 0;
}