1 solutions
-
-2
#include<bits/stdc++.h> using namespace std; int n,m,k; string a,b; int f[2][205][205],sum[2][205][205]; int main(){ cin>>n>>m>>k,cin>>a>>b,a=" "+a,b=" "+b; f[0][0][0]=1; for(int i=1;i<=n;i++){ for(int j=0;j<=m;j++){ for(int p=0;p<=k;p++){ if(a[i]==b[j])sum[i%2][j][p]=(sum[(i+1)%2][j-1][p]+f[(i+1)%2][j-1][p-1])%1000000007; else sum[i%2][j][p]=0; f[i%2][j][p]=(f[(i+1)%2][j][p]+sum[i%2][j][p])%1000000007; } } } cout<<f[n%2][m][k]%1000000007; return 0; }
- 1
Information
- ID
- 1714
- Time
- 1000ms
- Memory
- 125MiB
- Difficulty
- 4
- Tags
- # Submissions
- 35
- Accepted
- 8
- Uploaded By