Cod sursa(job #1383271)

Utilizator TarabanDragosTaraban Dragos-Petru TarabanDragos Data 10 martie 2015 04:09:53
Problema Subsir Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.17 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%s",s+1,t+1);
    n=strlen(s+1);
    m=strlen(t+1);
    for(i=0;i<=n;i++){
        x[i][0]=1;
    }
    for(i=0;i<=m;i++){
        x[0][i]=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-1][j]==d[i][j-1]){
                d[i][j]=d[i-1][j];
                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-1][j]>d[i][j-1]){
                d[i][j]=d[i-1][j];
                x[i][j]=x[i-1][j];
            }
            else{
                d[i][j]=d[i][j-1];
                x[i][j]=x[i][j-1];
            }
        }
    }
    if(x[n][m]<0)
        x[n][m]+=MOD;
    fprintf(g,"%d",x[n][m]);

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