Pagini recente » Cod sursa (job #440295) | Cod sursa (job #434101) | Cod sursa (job #2785073) | Cod sursa (job #2538392) | Cod sursa (job #443681)
Cod sursa(job #443681)
#include<stdio.h>
char a[502], b[502];
int x[501][501];
long y[501][501],s;
int m,n,i,j,k,u,v,w;
int main()
{
freopen("subsir.in","r",stdin);
freopen("subsir.out","w",stdout);
scanf("%s\n%s",a+1,b+1);
m=1;while (a[m++]);
n=1;while (b[n++]);
m--;
n--;
for (j=0;j<=n;j++)x[0][j]=0;
for (i=0;i<=m;i++)x[i][0]=0;
for (i=1;i<=m;i++)
for (j=1;j<=n;j++)
if (a[i]==b[j]) x[i][j]=1+x[i-1][j-1];
else if (x[i-1][j]>x[i][j-1]) x[i][j]=x[i-1][j];
x[i][j]=x[i][j-1];
for (i=1;i<=m;i++)
for (j=1;j<=n;j++)
{
y[i][j]=0;
if (x[i][j]==1 && a[i]==b[j]) y[i][j]=1;
}
for (k=2;k<=x[m][n];k++)
{
s=0;
for (i=m;i>=1;i--)
for (j=n;j>=1;j--)
if (x[i][j]==k && a[i]==b[j])
{
w=1;
for (u=i-1;u>=1;u--)
{
for (v=j-1;v>=w;v--)
if (x[u][v]==k-1 && a[u]==b[v])break;
y[i][j]=(y[i][j]+y[u][v])%666013;
w=v+1;
}
s=(s+y[i][j])%666013;
}
if (k==x[m][n])printf("%ld",s);
}
fclose(stdin);
fclose(stdout);
return 0;
}