6-14牛客网小白月赛 A-最少胜利题数 题型:模拟

A-最少胜利题数_牛客小白月赛96 (nowcoder.com)

刚开始我想的太复杂了,其实很简单.

如果长度长的那个字符串是6的话,那么较短的那个不可能超过他(最长就是6)

#include<bits/stdc++.h>
using namespace std;

int main()
{
	string s1,s2;cin>>s1>>s2;
    if(s1.size()>s2.size()) swap(s1,s2);
    
    if(s2.size()==6) cout<<"-1"<<endl;
    else cout<<s2.size()-s1.size()+1<<endl;
	return 0;
}#include<bits/stdc++.h>
using namespace std;

int main()
{
	string s1,s2;cin>>s1>>s2;
    if(s1.size()>s2.size()) swap(s1,s2);
    
    if(s2.size()==6) cout<<"-1"<<endl;
    else cout<<s2.size()-s1.size()+1<<endl;
	return 0;
}