Anton and currency you all know
Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is now assumed to be an integer.
Reliable sources have informed the financier Anton of some information about the exchange rate of currency you all know against the burle for tomorrow. Now Anton knows that tomorrow the exchange rate will be an even number, which can be obtained from the present rate by swapping exactly two distinct digits in it. Of all the possible values that meet these conditions, the exchange rate for tomorrow will be the maximum possible. It is guaranteed that today the exchange rate is an odd positive integer n. Help Anton to determine the exchange rate of currency you all know for tomorrow!
InputThe first line contains an odd positive integer n — the exchange rate of currency you all knowfor today. The length of number n's representation is within range from 2 to 105, inclusive. The representation of n doesn't contain any leading zeroes.
If the information about tomorrow's exchange rate is inconsistent, that is, there is no integer that meets the condition, print - 1.
Otherwise, print the exchange rate of currency you all know against the burle for tomorrow. This should be the maximum possible number of those that are even and that are obtained from today's exchange rate by swapping exactly two digits. Exchange rate representation should not contain leading zeroes.
527
572
4573
3574
1357997531
-1
题目大意:输入一个数n,可以交换其中任意两个数字(只能交换一次),使最后得到尽可能大的偶数,如果不能得到偶数就输出-1。
思路:如果每位数都是奇数,无法得到偶数,直接输出-1。若有偶数,就找到第一个小于最后一位的偶数数字交换。若没有找到小于最后一位的偶数,就找到最后一个偶数与最后一位进行交换。
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char a[100005];
int main()
{
scanf("%s",a);
int n,flag=0,k;
n=strlen(a);
for(int i=0;i<n;i++)
if((a[i]-'0')%2==0)
{
flag=1;
break;
}
if(!flag)
printf("-1\n");
else
{
for(int i=0;i<n;i++)
{
if((a[i]-'0')%2==0)
{
if((a[i]-'0')<(a[n-1]-'0'))
{
char s=a[n-1];
a[n-1]=a[i];
a[i]=s;
flag=0;
printf("%s\n",a);
break;
}
k=i;
}
}
if(flag)
{
char s=a[n-1];
a[n-1]=a[k];
a[k]=s;
printf("%s\n",a);
}
}
return 0;
}