题目1042：Coincidence

#include <iostream>
#include <fstream>
#include <cstring>
#include <algorithm>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 110;

char s1[N], s2[N];
int f[N][N];

int main()
{

    #ifndef ONLINE_JUDGE
        ifstream cin("d:\\OJ\\uva_in.txt");
    #endif // ONLINE_JUDGE

    while (cin.getline(&s1[1], N) && cin.getline(&s2[1], N)) {
        memset(f, 0x00, sizeof(f));
        int n = strlen(&s1[1]);
        int m = strlen(&s2[1]);

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                if (s1[i] == s2[j]) {
                    f[i][j] = f[i - 1][j - 1] + 1;
                } else {
                    f[i][j] = max(f[i - 1][j], f[i][j - 1]);
                }
            }
        }

        cout << f[n][m] << endl;
    }
    return 0;
}