Cod sursă (job #405015)

#include <iostream>
#include <fstream>
using namespace std;

int main()
{
    short int t;
    long long int n,k,i,j,s;
    ifstream f("2sah.in");
    ofstream g("2sah.out");
    f>>t>>n>>k;
    int a[n+3][2*n+3];
    for(i=0;i<=2*n+2;i++)
        {
            a[1][i]=0;
            if(i==n+1) a[1][i]=1;
        }
    for(i=2;i<=n+1;i++)
    {
        a[i][0]=0;
        a[i][2*n+2]=0;
    }
    for(i=2;i<=n+1;i++)
    for(j=1;j<=2*n+1;j++)
    a[i][j]=a[i-1][j-1]+a[i-1][j]+a[i-1][j+1];


    if (t==1)
    {
    s=0;
    for (j=1;j<=2*n+1;j++)
        s+=a[k][j];

    g<<s;

    }
    else
    {
        s=0;
        i=1;
        while ((i<n+1) || (k<2*n+1))
        {
            s+=a[i][k];
            i++;
            k+=2;
        }

        g<<s;
    }
    return 0;
}