Cod sursa(job #2079052)

Utilizator RazvanRometeRomete Razvan Vasile RazvanRomete Data 30 noiembrie 2017 14:47:46
Problema Subsir Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1 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];
int a[nm],b[nm],c[nm][nm],d[nm][nm],n,m,k,nr,f[nm];

int main()
{
    char ch;
    int i,j;
    fin.getline(s1,nm);n=strlen(s1);
    fin.getline(s2,nm);m=strlen(s2);
    for(i=0;i<n;++i)a[i+1]=s1[i]-'a'+1,d[i+1][0]=1;
    for(i=0;i<m;++i)b[i+1]=s2[i]-'a'+1,d[0][i+1]=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];
}