Pagini recente » Cod sursa (job #831938) | Cod sursa (job #210832) | Cod sursa (job #1590949) | Cod sursa (job #2488101) | Cod sursa (job #1813324)
#include <bits/stdc++.h>
#define Xp 666013
using namespace std;
ifstream f("subsir.in");
ofstream g("subsir.out");
char a[1<<9],b[1<<9];
int n,m,dp[1<<9][1<<9],nr[1<<9][1<<9];
int main()
{
f>>(a+1)>>(b+1);
n=strlen(a+1);
m=strlen(b+1);
for(int i=0;i<=n;i++) nr[i][0]=1;
for(int i=0;i<=m;i++) nr[0][i]=1;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
int &yep=dp[i][j];
int &nup=nr[i][j];
if(a[i]==b[j])
{
yep=dp[i-1][j-1]+1;
nup=nr[i-1][j-1];
}
else if(dp[i][j-1]<dp[i-1][j])
{
yep=dp[i-1][j];
nup=nr[i-1][j];
}
else if(dp[i][j-1]>dp[i-1][j])
{
yep=dp[i][j-1];
nup=nr[i][j-1];
}
else
{
yep=dp[i-1][j];
nup=(nr[i-1][j]+nr[i][j-1])%Xp;
if(dp[i-1][j-1]==dp[i-1][j]) nup=(nup-nr[i-1][j-1]+Xp)%Xp;
}
}
g<<nr[n][m];
return 0;
}