Cod sursă (job #251635)

#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("2sah.in");
ofstream g ("2sah.out");
int main()
{
    int p,n,k,i,j,s=0;
    f>>p>>n>>k;
    int a[n+1][2*n+1];
        for(i=1;i<=n+1;i++)
        {
            for(j=1;j<=2*n+1;j++)
            {
                a[i][j]=0;
            }
        }
        a[1][((2*n+1)/2)+1]=1;
        for(i=2;i<=n+1;i++)
        {
            a[i][((2*n+1)/2)+1-i+1]=1;
            a[i][((2*n+1)/2)+i]=1;
        }
        for(i=2;i<=n+1;i++)
        {
            for(j=1;j<=2*n+1;j++)
            {
                if(a[i][j]==1)
                {
                    for(j+=1;a[i][j]!=1;j++)
                    {
                        a[i][j]=a[i-1][j-1]+a[i-1][j]+a[i-1][j+1];
                    }
                }
            }
        }
    switch(p)
    {
    case 1:
        for(j=1;j<=n*2+1;j++)
        {
            if(a[k][j]==0)
            {
                continue;
            }
            s+=a[k][j];
        }
    g<<s;
    break;

    case 2:
        i=1;
        while(k<=n*2+1)
        {
            s+=a[i][k];
            i++;
            k+=2;
        }
        g<<s;
        break;
    }
}