Cod sursa(job #2485151)

Utilizator denmirceaBrasoveanu Mircea denmircea Data 1 noiembrie 2019 01:17:53
Problema Iv Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.28 kb
#include <bits/stdc++.h>
using namespace std;
#define dim 505
#define mod 3210121
ifstream fin("iv.in");
ofstream fout("iv.out");
int d[2][dim][dim],l,i,j,n,m,sol,x;
char s1[dim],s2[dim];
int main()
{
  fin>>(s1+1)>>(s2+1);
  n=strlen(s1+1);
  m=strlen(s2+1);
  if(s1[1]==s1[n])
    d[1-x][1][1]=1;
  if(s2[1]==s2[m])
    d[1-x][0][0]=1;
  if(s1[1]==s2[m])
    d[1-x][1][0]=1;
  if(s2[1]==s1[n])
    d[1-x][0][1]=1;
   for(l=2;l<=(n+m)/2;l++){
        for(i=0;i<=n && i<=l;i++){
            for(j=0;i+j<=n && j<=l;j++){
                d[x][i][j]=0;
                if(s1[i]==s1[n-j+1] && i*j)
                    d[x][i][j]+=d[1-x][i-1][j-1];
                if(s1[i]==s2[m-(l-j)+1] && i>0 && j<l)
                    d[x][i][j]+=d[1-x][i-1][j];
                if(s2[l-i]==s1[n-j+1] && i<l && j>0)
                    d[x][i][j]+=d[1-x][i][j-1];
                if(s2[l-i]==s2[m-(l-j)+1] && i<l && j<l)
                    d[x][i][j]+=d[1-x][i][j];
                 d[x][i][j]%=mod;
            }
    }
    x=1-x;
  }
  if((n+m)%2)
        for(i=0;i<n;i++){
            sol+=d[1-x][i][n-i]+d[1-x][i][n-i-1];
            sol%=mod;
        }
    else
        for(i=0;i<=n;i++){
            sol+=d[1-x][i][n-i];
            sol%=mod;
        }

    fout<<sol;
}