Pagini recente » Cod sursa (job #1337111) | Cod sursa (job #2177805) | Cod sursa (job #2230822) | Cod sursa (job #1995152) | Cod sursa (job #777031)
Cod sursa(job #777031)
#include<fstream>
#include<cstring>
using namespace std;
#define MOD 666013
ifstream f("subsir.in");
ofstream g("subsir.out");
int i,j,m,n,sol[510][510],d[510][510];
char a[510],b[510];
int main()
{f>>(a+1)>>(b+1);
n=strlen(a);
m=strlen(b);
strcpy(a+1,a);
strcpy(b+1,b);
for(i=0;i<=n;++i)
sol[i][0]=1;
for(j=0;j<=m;++j)
sol[0][j]=1;
for(i=1;i<=n;++i)
for(j=1;j<=m;++j)
if(a[i]==b[j])
{sol[i][j]=sol[i-1][j-1];
d[i][j]=d[i-1][j-1]+1;
}
/* else
if(d[i][j-1]==d[i-1][j])
{d[i][j]=d[i-1][j];
sol[i][j]=(sol[i-1][j]+sol[i][j-1])%MOD;
if(d[i-1][j-1]==d[i][j-1])
sol[i][j]=(sol[i][j]-sol[i-1][j-1]+MOD)%MOD;
}
else
if(d[i][j-1]>d[i-1][j])
{d[i][j]=d[i][j-1];
sol[i][j]=sol[i][j-1];
}
else
if(d[i][j-1]<d[i-1][j])
{d[i][j]=d[i-1][j];
sol[i][j]=sol[i-1][j];
}*/
g<<sol[n][m];
return 0;
}