2 solutions

  • -2
    @ 2025-1-13 14:38:22
    #include<bits/stdc++.h>
    using namespace std;
    const int N=101;
    int f[N][N];
    char s1[N],s2[N];
    int main()
    {
    	int n,m;
    	cin>>s1;
    	cin>>s2;
    	n=strlen(s1);
    	m=strlen(s2); 
    	for(int i=1;i<n;i++)
    	{
    		for(int j=1;j<m;j++)
    		{
    			s1[i][j]=min(f[i-1][j-1],f[i-1][j-1]);
    			if(s1[i]!=s2[j])
    			{
    				s2[i][j]=min(f[i-1][j],f[i-1][j-1]+1); 
    			}
    		}
    	}
    	cout<<s2[n][m];
    	return 0;
    }
    
    

    Information

    ID
    982
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    5
    Tags
    (None)
    # Submissions
    59
    Accepted
    15
    Uploaded By