UVA - 1588 Kickdown

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_42623428/article/details/82987105

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

int n1,n2;
string a,b;
int min( int a, int b)
{
    return a<b?a:b;
}
int lenm(string s1,string s2,int n)
{
    int length=n1+n2;
    int minn=min(n1,n2);
    int len=length;
    for(int i=0;i<n;i++)
    {
        int k=1,f=min(n-i,minn);
        for(int j=0;j<f;j++)
        {
            if(s1[i+j]=='2'&&s2[j]=='2')
            {
                k=0;break;
            }
           }
           if(k&&len>length-f)len=length-f;

    }return len;
}
int main()
{
    while(cin>>a>>b)
    {
        n1=a.length();n2=b.length();
        cout<<min(lenm(a,b,n1),lenm(b,a,n2))<<endl;
    }
    return 0;
}