Cod sursa(job #1607917)

Utilizator TarabanDragosTaraban Dragos-Petru TarabanDragos Data 21 februarie 2016 18:31:44
Problema Subsir Scor 30
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.24 kb
#include<cstdio>
#include<cstring>
#define MOD 666013
int n,m,i,j,d[510][510],x[510][510];
char s[510],t[510];
FILE *f,*g;
int main(){
    f=fopen("subsir.in","r");
    g=fopen("subsir.out","w");
    fscanf(f,"%s\n%s",s+1,t+1);
    n=strlen(s+1);
    m=strlen(t+1);
    for(i=0;i<=n;i++){
        x[i][0]=1;
    }
    for(j=0;j<=m;j++){
        x[0][j]=1;
    }
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            if( s[i] == t[j] ){
                d[i][j] = d[ i - 1 ][ j - 1 ] + 1;
                x[i][j] = x[ i - 1 ][ j - 1 ];
            }
            else if( d[i][ j - 1 ] == d[ i - 1 ][j] ){
                d[i][j] = d[i][ j - 1 ];
                x[i][j] = ( x[ i - 1 ][j] + x[i][ j - 1 ] ) % MOD;
                if( d[i][j] == d[ i - 1 ][ j - 1 ] )
                    x[i][j] = ( x[i][j] - x[ i - 1 ][ j - 1 ] ) % MOD;
            }
            else if( d[i][ j - 1 ] > d[ i - 1 ][j] ){
                d[i][j] = d[i][ j - 1 ];
                x[i][j] = x[i][ j - 1 ];
            }
            else{
                d[i][j] = d[ i - 1 ][j];
                x[i][j] = x[ i - 1 ][j];
            }
        }
    }
    fprintf(g,"%d",x[n-1][m-1]);



    fclose(f);
    fclose(g);
    return 0;
}