Cod sursa(job #1709537)

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




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

    int n,m,i,j,k;
    fscanf(f,"%i%i",&n,&m);
    int**a,**c;
    a = (int**)malloc((n+1)*sizeof(int*));
    c = (int**)malloc((n+1)*sizeof(int*));

    for(i=0;i<=n;i++)
    {
        a[i] = (int*)calloc((m+1),sizeof(int));
        c[i] = (int*)calloc((m+1),sizeof(int));
    }
    fscanf(f,"%i",&k);
    while(k--)
    {
        fscanf(f,"%i%i",&i,&j);
        a[i][j] = 1;
    }

    for(i=2;i<=n;i++) c[i][1] = 1;
    for(i=2;i<=m;i++) c[1][i] = 1;

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

    fprintf(g,"%i\n",c[n][m]);



    return 0;
}