hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh

#include <bits/stdc++.h>
using namespace std;
int main()
{
    string s1,s2;
    while(cin>>s1>>s2){
        int l1=s1.size(),l2=s2.size();
        vector<vector<int>> dp(l1+1,vector<int>(l2+1,0));
        for(int i=1
 
;i<=l1;++i){
            for(int j=1;j<=l2;++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[l1][l2]);
    }
    return 0;
}

hdu 1159 Common Subsequence