Submission

PPPPPPPPPP

Score: 100

User: osensunny

Problemset: Dvaravati-LCS

Language: cpp

Time: 0.059 second

Submitted On: 2025-03-20 23:42:52

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

string s1, s2, ans, dp[605][605];
int n;

string solve(){
	n = s1.size();
	s1 = ' ' + s1;
	s2 = ' ' + s2;
	
	for(int i=1; i<=n; i++){
		for(int j=1; j<=n; j++){
			if(s1[i] == s2[j]) dp[i][j] = dp[i-1][j-1] + s1[i];
			else{
				if(dp[i-1][j].size() > dp[i][j-1].size()) dp[i][j] = dp[i-1][j];
				else dp[i][j] = dp[i][j-1];
			}
		}
	}
	
	return dp[n][n];
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	
	cin >> s1 >> s2;
	
	ans = solve();
	cout << ans << '\n' << ans.size() << '\n';
	if(ans.size() > (s1.size()/2)) cout << 'y';
	else cout << 'n';
	
	return 0;
}