Cod sursa(job #1709751)

Utilizator space_tab_endlnSapientia CryptoAllnight space_tab_endln Data 28 mai 2016 13:44:34
Problema Padure2 Scor 0
Compilator c Status done
Runda ONIS 2016 - Runda - 2 - ACM ICPC Romanian Programming Contest Marime 1.24 kb
#include <stdio.h>
#include <stdlib.h>

//int a[1000000][1000000] = {0};

#define Z 2000003

int main()
{
    freopen("padure2.in","r",stdin);
    freopen("padure2.out","w",stdout);
    //FILE *f = fopen("padure2.in","r");
    //FILE *g = fopen("padure2.out","w");

    int n,m,i,j,k,h;
    scanf("%i%i",&n,&m);
    int **a;

    a = (int**)malloc((n)*sizeof(int*));


    for(i=0;i<n;i++)
    {
        a[i] = (int*)calloc((m),sizeof(int));

    }
    scanf("%i",&k);
    while(k--)
    {
        scanf("%i%i",&i,&j);
        a[i-1][j-1] = -1;
    }

    h=1;
    for(i=1;i<n;i++)
    {
        if(a[i][0] == -1)
        {
            h = 0;
            a[i][0] = h;

            }
            else a[i][0] = h;
    }
    h = 1;
    for(i=1;i<m;i++)
        if(a[0][i] == -1)
        {
            h = 0;
            a[0][i] = h;

            }
            else a[0][i] = h;

    for(j=1;j<n;j++)
    {
        for(i=1;i<m;i++)
        {
            if(a[i][j]==-1)
            {
                a[i][j] = 0;
            }
            else
            {
                a[i][j] = (a[i-1][j] + a[i][j-1])%Z;
            }
        }
    }

    printf("%i\n",(a[i-1][j-1]));



    return 0;
}