Codeforces 766A-Mahmoud and Longest Uncommon Subsequence

最新推荐文章于 2018-04-15 16:50:52 发布

原创最新推荐文章于 2018-04-15 16:50:52 发布 · 254 阅读

0 ·

CC 4.0 BY-SA版权

----水题同时被 2 个专栏收录

234 篇文章

订阅专栏

Codeforces

140 篇文章

订阅专栏

本文介绍了一个关于寻找两个字符串的最长非公共子序列的问题，包括问题描述、输入输出格式及示例。通过简单的C++代码实现了解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

output
5

input
a
a

output
-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.

题意：给出两个字符串，问最长非公共序列的长度，若完全一样则输出-1

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;
#define LL long long

int main()
{
    char s1[100009],s2[100009];
    while(~scanf("%s %s",s1,s2))
    {
        int len1=strlen(s1),len2=strlen(s2);
        if(strcmp(s1,s2)) printf("%d\n",len1>len2?len1:len2);
        else printf("-1\n");
    }
    return 0;
}