UVa 1588 Kickdown

#include<cstdio>
#include<algorithm>
#include<cstring>
#define maxn 105
using namespace std;
int f(char *mas,char *dri);
int main()
{
	char mas[maxn]={0},dri[maxn]={0};
	while(scanf("%s%s",mas,dri)!=EOF)
	{
		printf("%d\n",min(f(mas,dri),f(dri,mas)));
		memset(dri,0,sizeof(dri));
		memset(mas,0,sizeof(mas));
	}
}
int f(char *mas,char *dri)
{
	int mp=0,dp=0,cnt=0,i;
	int mlen=strlen(mas),dlen=strlen(dri);
	while(1)
	{
		int ok=1;
		for(i=0;i<dlen;i++)
		if(((i+mp)>=mlen?0:mas[i+mp])+dri[i]>(3+2*'0')){
			ok=0;
			break;
		}
		if(ok) {
			cnt+=i-dp;
			break;
		}
		mp++;
		cnt++;
	}
	return (cnt>mlen?cnt:mlen);
}