Pagini recente » Cod sursa (job #2129354) | Cod sursa (job #1800875) | Cod sursa (job #2320136) | Cod sursa (job #2119470) | Cod sursa (job #6441)
Cod sursa(job #6441)
#include<stdio.h>
#include<string.h>
#define NR 666013
char a[502],b[502];
int n,m,s[502][502],ra[502][30],rb[502][30];
long ns[502][502];
void READ()
{ int i;
FILE *f;
f=fopen("subsir.in","r");
fscanf(f,"%s",&a);
n=strlen(a);
for(i=n;i>0;i--)
a[i]=a[i-1];
fscanf(f,"%s",&b);
m=strlen(b);
for(i=m;i>0;i--)
b[i]=b[i-1];
fclose(f);
}
void BUILD()
{ int i,j;
for(i=1;i<=n;i++)
{
for(j='a'-65;j<='z'-65;j++)
ra[i][j]=ra[i-1][j];
ra[i][a[i]-65]=i;
}
for(i=1;i<=n;i++)
{
for(j='a'-65;j<='z'-65;j++)
rb[i][j]=rb[i-1][j];
rb[i][b[i]-65]=i;
}
}
void SOLVE()
{ int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
if(a[i]==b[j])
{
s[i][j]=s[i-1][j-1]+1;
ns[i][j]=(s[i][j]==1?1:ns[i-1][j-1]);
}
else {
if(s[i-1][j]>s[i][j]) s[i][j]=s[i-1][j];
if(s[i][j-1]>s[i][j]) s[i][j]=s[i][j-1];
if(s[i-1][j]>s[i][j-1])
{ ns[i][j]=ns[i-1][j];
if(s[ ra[i-1][ a[i]-65 ] ][ rb[j] [ a[i]-65 ] ]!= s[i][j] && s[ i ][ rb[j] [ a[i]-65 ] ]==s[i][j])
ns[i][j]+=ns[i][rb[j][a[i]-65]];
}
else
{ ns[i][j]=ns[i][j-1];
if(s[ ra[i][ b[j]-65 ] ][ rb[j-1] [ b[j]-65 ] ]!= s[i][j] && s[ ra[i][ b[j]-65 ] ][ j ]==s[i][j])
ns[i][j]+=ns[ra[i][b[j]-65]][j];
}
}
}
}
void PRINT()
{
FILE *g;
g=fopen("subsir.out","w");
fprintf(g,"%ld\n",ns[n][m]);
fclose(g);
}
int main()
{
READ();
BUILD();
SOLVE();
PRINT();
return 0;
}