只需要帮我挑到70分 玄关

#include<bits/stdc++.h>
using namespace std;
#define akioi ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define db double
#define ull unsigned long long
#define endl '\n'
const int NR = 5010;
const int mod = 1e8;

int dp[NR][NR];
int cnt[NR][NR];

int main()
{
    string a,b;
    cin>>a>>b;
    int n=a.size()-1,m=b.size()-1;
    a = ' ' + a;
    b = ' ' + b;
    
    for(int i=0;i<=n;i++)cnt[i][0]=1;
    for(int i=0;i<=m;i++)cnt[0][i]=1;
    
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(a[i]==b[j])dp[i][j]=dp[i-1][j-1]+1;
            else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
        
            if(dp[i][j]==dp[i-1][j])
            {
                ll q = cnt[i][j];
                ll p = cnt[i-1][j];
                ll x = q+p;
                cnt[i][j]=x%mod;
            }
            if(dp[i][j]==dp[i][j-1])
            {
                ll q = cnt[i][j];
                ll p = cnt[i][j-1];
                ll x = q+p;
                cnt[i][j]=x%mod;
            }
            if(dp[i][j]==dp[i-1][j-1])
            {
                cnt[i][j]=(cnt[i][j]%mod-cnt[i-1][j-1]%mod)%mod;
            }
            if(a[i]==b[j])
            {
                ll q = cnt[i][j];
                ll p = cnt[i-1][j-1];
                ll x = q+p;
                cnt[i][j]=x%mod;
            }
        }
    }
    cout<<dp[n][m]<<endl<<cnt[n][m]%mod<<endl;
    return 0;
}