POJ 2681

 #include<iostream>
 #include<stdio.h>
 #include<string>
 #include<algorithm>
 #define MAXN 50
 using namespace std;
 char ch1[MAXN];
 char ch2[MAXN];
 int dig1[MAXN];
 int dig2[MAXN];
 int main()
 {
     //freopen("acm.acm","r",stdin);
     int num;
     char c;
     int i;
     int j;
     int ans;
     int len[];
     int time;
     int place;
     int begin;
     cin>>num;
     getchar();
     for(time = ; time <= num; ++ time)
     {
         ans = ;
         memset(dig1,-,sizeof(dig1));
         memset(dig2,-,sizeof(dig2));
         gets(ch1);
         gets(ch2);
         len[] = strlen(ch1);
         len[] = strlen(ch2);
         for(i = ; i < len[]; ++ i)
         {
             dig1[i] = ch1[i] - 'a';
         }
         for(i = ; i < len[]; ++ i)
         {
             dig2[i] = ch2[i] - 'a';
         }
         //sort(dig2,dig2+len[1]);
         //sort(dig1,dig1+len[0]);
         begin = ;
         for(i = ;i < len[]; ++ i)
         {
             for(j = ; j < len[]; ++ j)
             if(ch1[i] == ch2[j])
             {
                 ch2[j] = '~';
                 ++ ans;
                 break;
             }
         }
         cout<<"Case #"<<time<<":  "<<len[]+len[]-*ans<<endl;
         ch1[] = '\0';
         ch2[] = '\0';
     }
 }