Codeforces Round 396 (Div. 2) 766A - Mahmoud and Longest Uncommon Subsequence Solution

 

 Problem Link : https://codeforces.com/problemset/problem/766/A

Solution in C++:

1. /// La ilaha illellahu muhammadur rasulullah
2. ///******Bismillahir-Rahmanir-Rahim******///
3. /// Abul Hasnat Tonmoy
4. /// Department of CSE,23rd batch
5. /// Islamic University,Bangladesh
6. ///**********ALLAH IS ALMIGHTY************///
7. #include<bits/stdc++.h>
8. using namespace std;
9. int main()
10. {
11. string a, b ;
12. cin >> a >> b ;
13. if ( a == b ) cout <<"-1"<<endl;
14. else cout <<max(a.size(),b.size())<<endl;
15. return 0;
16. }