B. Valued Keys

B. Valued Keys
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You found a mysterious function f. The function takes two strings s1 and s2. These strings must consist only of lowercase English letters, and must be the same length.

The output of the function f is another string of the same length. The i-th character of the output is equal to the minimum of the i-th character of s1 and the i-th character of s2.

For example, f("ab", "ba") = "aa", and f("nzwzl", "zizez") = "niwel".

You found two strings x and y of the same length and consisting of only lowercase English letters. Find any string z such that f(x, z) = y, or print -1 if no such string z exists.

Input

The first line of input contains the string x.

The second line of input contains the string y.

Both x and y consist only of lowercase English letters, x and y have same length and this length is between 1 and 100.

Output

If there is no string z such that f(x, z) = y, print -1.

Otherwise, print a string z such that f(x, z) = y. If there are multiple possible answers, print any of them. The string z should be the same length as x and y and consist only of lowercase English letters.

Examples
input
ab
aa
output
ba
input
nzwzl
niwel
output
xiyez
input
ab
ba
output
-1
Note

The first case is from the statement.

Another solution for the second case is "zizez"

There is no solution for the third case. That is, there is no z such that f("ab", z) =  "ba".


题解:根据题意,设三个字符串。然后根据函数特征扫一遍逐个判断,当x[i]>y[i]时,z+=y[i].当x[i]==y[i],z+=x[i]+temp(注意,x[i]+temp必须不大于z)

当x[I]<y[I]时,直接输出-1退出。

代码如下:

//
//  main.cpp
//  B. Valued Keys
//
//  Created by 徐智豪 on 2017/4/16.
//  Copyright © 2017年 徐智豪. All rights reserved.
//

#include <iostream>
#include <string>
using namespace std;
string x,y,z;
int main(int argc, const char * argv[]) {
    cin>>x>>y;
    int flag=1;
    int lengthx=(int)x.size();
    int lengthy=(int)y.size();
    if(lengthx==lengthy)
    for(int i=0;i<lengthx;i++)
    {
        if(x[i]==y[i])
        {
            if(x[i]<'z')
            z+=(x[i]+1);
            else
                z+=x[i];
        }
        else if(x[i]>y[i])
        {
            z+=y[i];
        }
        else if(x[i]<y[i])
        {
            flag=0;
            break;
        }
    }
    if(flag)
    cout<<z<<endl;
    else
        cout<<-1<<endl;
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值