Pagini recente » Cod sursa (job #1642721) | Cod sursa (job #1360288) | Cod sursa (job #2866395) | Cod sursa (job #2808945) | Cod sursa (job #1825848)
#include <cstdio>
#include <string.h>
using namespace std;
char a[502],b[502];
int n,m,t,i,j,v[502][502],w[502][502];
int main()
{
freopen("subsir.in","r",stdin);
freopen("subsir.out","w",stdout);
scanf("%s",a+1);
n=strlen(a+1);
scanf("%s",b+1);
m=strlen(b+1);
t=666013;
for(i=0; i<=n; i++)
{
w[i][0]=1;
}
for(j=0; j<=m; j++)
{
w[0][j]=1;
}
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
{
if(a[i]==b[j])
{
v[i][j]=v[i-1][j-1]+1;
w[i][j]=w[i-1][j-1];
}
else
if(v[i-1][j]>v[i][j-1])
{
v[i][j]=v[i-1][j];
w[i][j]=w[i-1][j];
}
else
if(v[i][j-1]>v[i-1][j])
{
v[i][j]=v[i][j-1];
w[i][j]=w[i][j-1];
}
else
{
v[i][j]=v[i-1][j];
w[i][j]=(w[i][j-1]+w[i-1][j])%t;
if(v[i-1][j-1]==v[i-1][j])
w[i][j]=(w[i][j]-w[i-1][j-1]+t)%t;
}
}
printf("%d",w[n][m]);
return 0;
}