每日一九度之 题目1042：Coincidence

//Asimple
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <cstdlib>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <limits.h>
#define INF 0x7fffffff
using namespace std;
const int maxn = 115;
typedef long long ll;
int n, num;
char s1[maxn], s2[maxn];
int dp[maxn][maxn];

int main(){
    while( cin >> s1 >> s2 ){
        int len1 = strlen(s1);
        int len2 = strlen(s2);
        for (int i=0; i<=len1; ++i)  
            dp[i][0] = 0;  
       for (int j=0; j<=len2; ++j)  
            dp[0][j] = 0; 
        for(int i=1; i<=len1; i++){
            for(int j=1; j<=len2; 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]);
                }
            }
        }
        printf("%d\n",dp[len1][len2]);
    }
    return 0;
}