UVa 1588 - Kickdown

#include <iostream>
#include <string>
#include <string.h>
using namespace std;

int a[210];
int xiao(string s1, string s2)
{
    int len1 = s1.length(), len2 = s2.length();
    int beg = 0;
    while (beg <= len1)
    {
        if (beg == len1)
        {
            return len1 + len2;
        }
        memset(a, 0, sizeof(a));
        for (int i = 0; i < len1; i++)
            a[i] += s1[i] - '0';
        for (int i = beg; i < len2 + beg; i++)
            a[i] += s2[i - beg] - '0';
        for (int i = 0; i < max(len1, len2 + beg); i++)
        {
            if (a[i] > 3)
            {
                beg++;
                break;
            }
            if (i == max(len1, len2 + beg) - 1)
            {
                return max(len1, len2 + beg);
            }
        }
    }
}

int main()
{
    string s1, s2;
    while (cin >> s1 >> s2)
    {
        cout << min(xiao(s1, s2), xiao(s2, s1)) << endl;
    }
    return 0;
}