constructive algorithms strings *1000

Please click on ads to support us..

Python Code:

def calc_unseq_string(a, b):
    if b not in a:
        return len(b)
    return calc_unseq_string(b[1:], a)


a = input()
b = input()
if a == b:
    print(-1)
else:
    sequence1 = calc_unseq_string(a, b)
    sequence2 = calc_unseq_string(b, a)
    print(max(sequence1, sequence2))

C++ Code:

#include <iostream>

using namespace std;

int main()
{
    string a,b;
    cin>>a>>b;
    if (a==b)
        cout <<-1<<"\n";
    if (a!=b)
        if (a.size()>b.size())
        cout <<a.size()<<"\n";
    else
        cout <<b.size()<<"\n";



    return 0;
}


Comments

Submit
0 Comments
More Questions

981A - Antipalindrome
365A - Good Number
1204B - Mislove Has Lost an Array
1409D - Decrease the Sum of Digits
1476E - Pattern Matching
1107A - Digits Sequence Dividing
1348A - Phoenix and Balance
1343B - Balanced Array
1186A - Vus the Cossack and a Contest
1494A - ABC String
1606A - AB Balance
1658C - Shinju and the Lost Permutation
1547C - Pair Programming
550A - Two Substrings
797B - Odd sum
1093A - Dice Rolling
1360B - Honest Coach
1399C - Boats Competition
1609C - Complex Market Analysis
1657E - Star MST
1143B - Nirvana
1285A - Mezo Playing Zoma
919B - Perfect Number
894A - QAQ
1551A - Polycarp and Coins
313A - Ilya and Bank Account
1469A - Regular Bracket Sequence
919C - Seat Arrangements
1634A - Reverse and Concatenate
1619C - Wrong Addition