1 solutions
-
1
#include<bits/stdc++.h> using namespace std; string s1,s2; void dfs(int l1,int r1,int l2,int r2) { int m=s2.find(s1[l1]); if(m>l2) dfs(l1+1,l1+m-l2,l2,m-1); if(m<r2) dfs(l1+m-l2+1,r1,m+1,r2); cout<<s1[l1]; } int main() { cin>>s1>>s2; dfs(0,s1.size()-1,0,s2.size()-1); return 0; }
- 1
Information
- ID
- 263
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- # Submissions
- 12
- Accepted
- 5
- Uploaded By