- Mahmoud and Longest Uncommon Subsequence

原创 2018年04月15日 16:50:52

题引

While Mahmoud and Ehab were practicing for IOI, they found a problem which name was Longest common subsequence. They solved it, and then Ehab challenged Mahmoud with another problem.Given two strings a and b, find the length of their longest uncommon subsequence, which is the longest string that is a subsequence of one of them and not a subsequence of the other.A subsequence of some string is a sequence of characters that appears in the same order in the string, The appearances don't have to be consecutive, for example, strings "ac", "bc", "abc" and "a" are subsequences of string "abc" while strings "abbc" and "acb" are not. The empty string is a subsequence of any string. Any string is a subsequence of itself.

Input

The first line contains string a, and the second line — string b. Both of these strings are non-empty and consist of lowercase letters of English alphabet. The length of each string is not bigger than 105 characters.

Output

If there's no uncommon subsequence, print "-1". Otherwise print the length of the longest uncommon subsequence of a and b.

Examples

Input

abcd

defgh

a

a

Output

5
-1

Note

In the first example: you can choose "defgh" from string b as it is the longest subsequence of string b that doesn't appear as a subsequence of string a.

****************************************************************************************************************************

#include <bits/stdc++.h>
#define max(a,b) (a>b?a:b)

using namespace std;

char a[100006],b[100006],c[2000006];
int t[200006];
bool g;

int main(){
	while(gets(a) ){
		gets(b);		
		if(!strcmp(a,b))
			printf("-1\n");
		else
			printf("%d\n",max(strlen(a),strlen(b)));
			
	}
}

Codeforces Round #396(Div. 2)A. Mahmoud and Longest Uncommon Subsequence【水题】

A. Mahmoud and Longest Uncommon Subsequence time limit per test 2 seconds memory limit per te...
  • mengxiang000000
  • mengxiang000000
  • 2017-02-09 16:53:33
  • 279

A. Mahmoud and Longest Uncommon Subsequence

time limit per test 2 seconds memory limit per test 256 megabytes input standard input ...
  • jj12345jj198999
  • jj12345jj198999
  • 2017-02-09 19:47:31
  • 1178

[LeetCode]521. Longest Uncommon Subsequence I(最长不寻常的序列 I)

521. Longest Uncommon Subsequence IGiven a group of two strings, you need to find the longest uncomm...
  • whl_program
  • whl_program
  • 2017-04-09 23:34:31
  • 2841

521. Longest Uncommon Subsequence I

521. Longest Uncommon Subsequence I
  • woshihuangjianwei
  • woshihuangjianwei
  • 2017-04-08 23:27:13
  • 1030

[Leetcode]522. Longest Uncommon Subsequence II

Longest Uncommon Subsequence II题目描述 Given a list of strings, you need to find the longest uncommon...
  • zsensei
  • zsensei
  • 2017-07-17 14:11:32
  • 1062

522. Longest Uncommon Subsequence II

Given a list of strings, you need to find the longest uncommon subsequence among them. The longest u...
  • zshouyi
  • zshouyi
  • 2017-05-06 01:21:00
  • 1443

C. Mahmoud and a Message

C. Mahmoud and a Message time limit per test 2 seconds memory limit per test 256 megabyt...
  • qq_33362864
  • qq_33362864
  • 2017-02-08 13:04:59
  • 455

python--leetcode521. Longest Uncommon Subsequence I

Given a group of two strings, you need to find the longest uncommon subsequence of this group of two...
  • wenqiwenqi123
  • wenqiwenqi123
  • 2017-10-07 21:49:57
  • 365

Mahmoud and Longest Uncommon Subsequence

While Mahmoud and Ehab were practicing for IOI, they found a problem which name was Longest common s...
  • lingxltime
  • lingxltime
  • 2018-01-15 15:39:05
  • 19
收藏助手
不良信息举报
您举报文章:- Mahmoud and Longest Uncommon Subsequence
举报原因:
原因补充:

(最多只允许输入30个字)