Pagini recente » Cod sursa (job #1328268) | Cod sursa (job #690711) | Cod sursa (job #1552546) | Cod sursa (job #2206818) | Cod sursa (job #2786036)
#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()
{
F>>(a+1),n=strlen(a+1),F>>(b+1),m=strlen(b+1);
for(i=0;i<=n;++i)
r[i][0]=1;
for(j=0;j<=m;++j)
r[0][j]=1;
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;
}