Advertisement
Farjana_akter

Untitled

Aug 21st, 2019
89
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.82 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. string s1,s2;
  4.  
  5. int main()
  6. {
  7. int i,j,k,ans,len1,len2;
  8. while(cin>>s1>>s2)
  9. {
  10. len1=s1.length();
  11. len2=s2.length();
  12. int dp[len1+5][len2+5];
  13. memset(dp,0,sizeof(dp));
  14.  
  15. for(i=0;i<=len1;i++)
  16. {
  17. for(j=0;j<=len2;j++)
  18. {
  19. if(i==0||j==0)
  20. dp[i][j]=0;
  21. else if(s1[i-1]==s2[j-1])
  22. dp[i][j]=dp[i-1][j-1]+1;
  23. else
  24. dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
  25. }
  26. }
  27. /* for(i=0;i<=len1;i++)
  28. {
  29. for(j=0;j<=len2;j++)
  30. cout<<dp[i][j]<<" ";
  31. cout<<endl;
  32. }
  33. */
  34. cout<<dp[len1][len2]<<endl;
  35.  
  36. }
  37. return 0;
  38. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement