UVa 1588 - Kickdown

给出两个长度分别为n1，n2（n1，n2≤100）且每列高度只为1或2的长条。需要将它们放入一个高度为3的容器（如图3-8所示），问能够容纳它们的最短容器长度。

#include<stdio.h>#include<string.h>char s1[120],s2[120];int main(){    while(scanf("%s%s",s1,s2)!=EOF)    {        int m,n,j,i,t,count1,count2;        m = strlen(s1);        n = strlen(s2);        t = 0; i = 0; j = 0;        while(j < m && i < n)        {            if(s1[j]-48+s2[i]-48 <= 3)            {                i++,j++;            }            else                t++,i=0,j=t;        }        count1 = m+n-i;        t = 0; i = 0; j = 0;         while(i < m && j < n)        {            if(s2[j]+s1[i]-96 <= 3)            {                i++,j++;            }            else                t++,i=0,j=t;        }        count2 = m+n-i;        printf("%d\n",count1 < count2 ? count1 : count2 );    }    return 0;}