UVA-1588

只用C来写

题目：https://vjudge.net/problem/UVA-1588

 #include<stdio.h>
 #include<string.h>
 #define LEN 1000

 int l(int lenth1,int lenth2,int keep)
 {
     int lenth;
     int m=lenth1-lenth2;
     if(keep<=m)lenth=lenth1;
     else lenth=keep+lenth2;
     return lenth;
 }

 int lp(int lenth1,int lenth2,int keep)
 {
     return (lenth2-keep-+lenth1);
 }
 int main()
 {
     char down[LEN]={''};
     char up[LEN]={''};
     while(scanf("%s",down)!=EOF)
     {

         int lenth1,lenth2,i;
         int check=,keep,LONG1,LONG2;
         int LONG;
         char* temp;
         scanf("%s",up);
         lenth1=strlen(down);
         lenth2=strlen(up);
         if(lenth1<lenth2)
         {
             char u[LEN];
             int mid;
             strcpy(u,down);
             for(i=;i<LEN;i++)down[i]='\0';
             strcpy(down,up);
             for(i=;i<LEN;i++)up[i]='\0';
             strcpy(up,u);
             mid=lenth1;
             lenth1=lenth2;
             lenth2=mid;
         }
         temp=&up[];
         for(i=;;i++)
         {
             if(i==lenth1){LONG1=lenth1+lenth2;break;}
             keep=i;
             for(;temp<=&up[lenth2-];temp++,i++)
             {
                 int sum;
                 if(down[i]!='\0')sum=(*temp-'')+(down[i]-'');
                 if(down[i]=='\0')sum=;
                 if(sum==){check=;break;}
                 if(sum!=)check=;
             }
             if(check==){LONG1=l(lenth1,lenth2,keep);break;}
             i=keep;
             temp=&up[];
         }
         temp=&up[lenth2-];
         check=;
         for(i=lenth2-;;i--)
         {
             if(i==-){LONG2=lenth1+lenth2;break;}
             keep=i;
             for(;temp>=&up[];temp--,i--)
             {
                 int sum;
                 if(down[i]!='\0')sum=(*temp-'')+(down[i]-'');
                 if(down[i]=='\0')sum=;
                 if(sum==){check=;break;}
                 if(sum!=)check=;
             }
             if(check==){LONG2=lp(lenth1,lenth2,keep);break;}
             i=keep;
             check=;
             temp=&up[lenth2-];
         }
         LONG=(LONG1>LONG2)?LONG2:LONG1;
         printf("%d\n",LONG);
         for(i=;i<LEN;i++)up[i]='\0';
         for(i=;i<LEN;i++)down[i]='\0';
     }
     return ;
 }