Pagini recente » Cod sursa (job #660543) | Profil llalexandru | Cod sursa (job #3294549) | Cod sursa (job #2354940) | Cod sursa (job #3156056)
#include<bits/stdc++.h>
using namespace std;
ifstream F("subsir.in");
ofstream G("subsir.out");
#define M 666013
char a[502],b[502];
int n,m,i,j,A[502][502],r[502][502];
int main()
{
for(F>>a>>b,n=strlen(a),i=n;i;a[i]=a[i-1],r[i][0]=1,--i);
for(m=strlen(b),j=m;j;b[j]=b[j-1],r[0][j]=1,--j);
for(i=1;i<=n;++i)
for(j=1;j<=m;++j)
if(a[i]==b[j])
A[i][j]=A[i-1][j-1]+1,r[i][j]=r[i-1][j-1];
else if(A[i-1][j]>A[i][j-1])
A[i][j]=A[i-1][j],r[i][j]=r[i-1][j];
else if(A[i][j-1]>A[i-1][j])
A[i][j]=A[i][j-1],r[i][j]=r[i][j-1];
else {
A[i][j]=A[i-1][j],r[i][j]=(r[i][j-1]+r[i-1][j])%M;
if(A[i-1][j-1]==A[i-1][j])
r[i][j]=(r[i][j]-r[i-1][j-1]+M)%M;
}
G<<r[n][m];
return 0;
}