Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstring>
- using namespace std;
- int dp[101][101];
- int main()
- {
- char s[101],t[101];
- cin>>s>>t;
- int n=strlen(s),m=strlen(t);
- int x;
- for(int i=1;i<=100;++i)
- dp[i][0]=dp[0][i]=200;
- for(int i=1;i<=n;++i)
- for(int j=1;j<=m;++j)
- {
- if(s[i-1]==t[j-1])
- x=0;
- else
- x=1;
- dp[i][j]=min(1+dp[i-1][j],min(1+dp[i][j-1],x+dp[i-1][j-1]));
- }
- cout<<dp[n][m]<<'\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement