Cod sursa(job #2079066)

Utilizator RazvanRometeRomete Razvan Vasile RazvanRomete Data 30 noiembrie 2017 15:02:11
Problema Subsir Scor 20
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.96 kb
#include <iostream>
#include <fstream>
#include <cstring>
#define nm 501
#define mod 666013

using namespace std;

ifstream fin("subsir.in");
ofstream fout("subsir.out");

char s1[nm],s2[nm],a[nm],b[nm];
int c[nm][nm],d[nm][nm],n,m,k,nr,f[nm];

int main()
{
    char ch;
    int i,j;
    fin.getline(a+1,nm);n=strlen(a+1);
    fin.getline(b+1,nm);m=strlen(b+1);
    for(i=0;i<=n;++i)d[i][0]=1;
    for(i=0;i<=m;++i)d[0][i]=1;
    for(i=1;i<=n;++i)
        for(j=1;j<=m;++j)
        {
            if(a[i]==b[j])c[i][j]=c[i-1][j-1]+1,d[i][j]=d[i-1][j-1];
            else if(c[i-1][j]>c[i][j-1])c[i][j]=c[i-1][j],d[i][j]=d[i-1][j];
            else if(c[i-1][j]<c[i][j-1])c[i][j]=c[i][j-1],d[i][j]=d[i][j-1];
            else
            {
                c[i][j]=c[i-1][j];
                d[i][j]=(d[i-1][j]+d[i][j-1]+m)%m;
                if(c[i-1][j-1]==c[i-1][j])d[i][j]=(d[i][j]-d[i-1][j-1]+m)%m;
            }
        }
    fout<<d[n][m];
}