UVa 10192 - Vacation

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>

using namespace std;
string s1, s2;
int dp[105][105], Case;

int LCS ( string s1, string s2 ) {
int m = s1.length ( ), n = s2.length ( );
//printf ( "%d %d\n", m, n );
dp[0][0] = 0;
for ( int i = 1; i <= m; dp[i][0] = 0, ++i ) ;
for ( int i = 1; i <= n; dp[0][i] = 0, ++i ) ;
for ( int i = 1; i <= m; ++i )
for ( int j = 1; j <= n; ++j ) {
if ( s1[i - 1] == s2[j - 1] ) dp[i][j] = dp[i - 1][j - 1] + 1;
else dp[i][j] = max ( dp[i - 1][j], dp[i][j - 1] );
}
return dp[m]
;
}

int main ( ) {
Case = 1;
while ( getline ( cin, s1 ) ) {
if ( s1[0] == '#' ) break;
getline ( cin, s2 );
cout << "Case #" << Case++ << ": you can visit at most " << LCS ( s1, s2 ) << " cities." << endl;
}
}