Cod sursa(job #2256215)

Utilizator MihaelaCismaruMihaela Cismaru MihaelaCismaru Data 8 octombrie 2018 11:10:47
Problema Iv Scor 15
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.52 kb
#include<fstream>
#include<cstring>
using namespace std;
ifstream in("iv.in");
ofstream out("iv.out");
int na,nb,mat[501][501][501];
char a[501],b[501];
const int  mod = 3210121;
int main (void) {
    in >> a+1;
    in >> b+1;
    na=strlen (a+1);
    nb=strlen (b+1);
    mat[0][0][na+1] = 1;
    for (int i = 0; i <= na; i ++) {
        for (int j = 0; j <= nb; j ++) {
            for (int k = na+1; k >= 1; k --) {
                if (i == 0 && j == 0 && k == na+1) continue;
                int l = nb + 1 - (i+j-(na+1 - k));
                if ((i > 0 || j > 0) && (k < na+1 || l < nb+1) && (i<=k) && (j<=l)) {

                    if (a[i] == a[k] && i > 0 && k < na+1) {
                        mat[i][j][k] = (mat[i][j][k] + mat[i-1][j][k+1]) % mod;
                    }
                    if (a[i] == b[l] && i > 0 && l < nb+1) {
                        mat[i][j][k] = (mat[i][j][k] + mat[i-1][j][k]) % mod;
                    }
                    if (b[j] == a[k] && j > 0 && k < na+1) {
                        mat[i][j][k] = (mat[i][j][k] + mat[i][j-1][k+1]) % mod;
                    }
                    if (b[j] == b[l] && j > 0 && l < nb+1) {
                        mat[i][j][k] = (mat[i][j][k] + mat[i][j-1][k]) % mod;
                    }

                }
            }
        }
    }
    int sol = 0;
    for (int i = 0; i <= na; i ++) {
        for (int j = 0; j <= nb; j ++) {
            sol = (sol + mat[i][j][i+1]) % mod;
        }
    }
    out << sol;

    return 0;
}