Submission

Score: 100

User: faofao

Problemset: Dvaravati-LCS

Language: cpp

Time: 0.003 second

Submitted On: 2026-03-19 21:29:11

#include <bits/stdc++.h>
using namespace std;

int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    string s1,s2; cin >> s1 >> s2;
    int n = s1.length();
    int dp[n+1][n+1];
    memset(dp,0,sizeof(dp));

    for(int i=1;i<=n;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]);
        }
    }
    int i=n,j=n;
    stack<char> ans;
    while(i>=1 && j>=1){
        if(s1[i-1]==s2[j-1]){
            ans.push(s1[i-1]);
            i--;
            j--;
        }
        else if(dp[i-1][j] > dp[i][j-1]) i--;
        else j--;
    }
    while(!ans.empty()){
        cout << ans.top();
        ans.pop();
    }
    cout <<"\n";
    cout << dp[n][n] << "\n";
    if(dp[n][n] > n/2) cout << "y";
    else cout << "n" ;
}