Problem:
Score : 100 points

Problem Statement

You are given strings s and t.
Find one longest string that is a subsequence of both s and t.

Notes

A subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.

Constraints

s and t are strings consisting of lowercase English letters.

1 \leq |s|, |t| \leq 3000

Input

Input is given from Standard Input in the following format:

s
t

Output

Print one longest string that is a subsequence of both s and t.
If there are multiple such strings, any of them will be accepted.

Sample Input 1

axyb
abyxb

Sample Output 1

axb

The answer is axb or ayb; either will be accepted.

Sample Input 2

aa
xayaz

Sample Output 2

aa

Sample Input 3

a
z

Sample Output 3

The answer is (an empty string).

Sample Input 4

abracadabra
avadakedavra

Sample Output 4

aaadara

Solution in C++ (GCC 9.2.1) (judge verdict: Runtime Error)

#include <bits/stdc++.h> 
using namespace std; 
int main(){
	string s,x;
	cin>>s>>x;
	string dp[s.length()+1][x.length()+1];
	for (int i=0;i<=s.length();i++){
		for(int j=0;j<=x.length();j++){
			if (i==0 || j==0){
				dp[i][j]="";
			}
			else if(s[i-1]==x[j-1]){
				dp[i][j]=dp[i-1][j-1]+s[i-1];
				
			}
			else{
				if(dp[i-1][j].length()>dp[i][j-1].length()){
					dp[i][j]=dp[i-1][j];
				}
				else{
					dp[i][j]=dp[i][j-1];
				}
			}
		}
	}
	cout<<dp[s.length()][x.length()];
	
	
}