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[2];
    int time;
    int place;
    int begin;
    cin>>num;
    getchar();
    for(time = 1; time <= num; ++ time)
    {
        ans = 0;
        memset(dig1,-1,sizeof(dig1));
        memset(dig2,-1,sizeof(dig2));
        gets(ch1);
        gets(ch2);
        len[0] = strlen(ch1);
        len[1] = strlen(ch2);
        for(i = 0; i < len[0]; ++ i)
        {
            dig1[i] = ch1[i] - 'a';
        }
        for(i = 0; i < len[1]; ++ i)
        {
            dig2[i] = ch2[i] - 'a';
        }
        //sort(dig2,dig2+len[1]);
        //sort(dig1,dig1+len[0]);
        begin = 0;
        for(i = 0;i < len[0]; ++ i)
        {
            for(j = 0; j < len[1]; ++ j)
            if(ch1[i] == ch2[j])
            {
                ch2[j] = '~';
                ++ ans;
                break;
            }
        }
        cout<<"Case #"<<time<<":  "<<len[0]+len[1]-2*ans<<endl;
        ch1[0] = '\0';
        ch2[0] = '\0';
    }
}