UVA_10192_Vacation

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <limits.h>
#include <stdlib.h>
#include <cmath>
#define LL unsigned long long
using namespace std;
int lcs[110][110];
int main() {
    int n1,n2;
    char x[110];char y[110];
    int cont=1;
    while(gets(x)){
        if(strcmp(x,"#")==0) break;
        gets(y);
        n1=strlen(x);n2=strlen(y);
        for(int i=1;i<=n1;i++){
            for(int j=1;j<=n2;j++){
                if(x[i-1]==y[j-1]){
                    lcs[i][j]=1+lcs[i-1][j-1];
                }else{
                    lcs[i][j]=max(lcs[i-1][j],lcs[i][j-1]);
                }
            }
        }
        printf("Case #%d: you can visit at most %d cities.\n",cont,lcs[n1][n2]);
        cont++;

    }
    return 0;
}