Submission

P-PPPPPPPP

Score: 90

User: Jokul

Problemset: เทน้ำ

Language: c

Time: 0.001 second

Submitted On: 2025-04-18 19:02:10

#include <stdio.h>

int main() {
    int n, l, x, edge= 1;
    scanf("%d %d %d", &n, &l, &x);
    int maxl=2*l;
    int minl=0;
    int a[n+1][maxl+1];
    for (int i = 0; i <=n; i++) {
        for (int j = 0; j<=maxl; j++) {
            a[i][j] = 0;
        }
    }
    a[0][x]=1;
    for (int i = 0; i <n; i++) {

        for(int j =1; j<maxl; j++) {
            if(a[i][j]>0){
                if(j+1==maxl)
                {
                    a[i+1][j-1]+=a[i][j];
                }
                else
                {
                  a[i+1][j+1]+=a[i][j];

                }
                if(j-1==0)
                    {
                        a[i+1][j+1]+=a[i][j];
                    }
                    else
                    {
                      a[i+1][j-1]+=a[i][j];

                    }
            }
        }
    }

    for(int j=0;j<maxl;j++)
        {
            if(n%2==1)
                {
                    if(j%2==0)
                    {
                        printf("%d ",a[n][j]);
                    }
                }
            else if(n%2==0)
            {
                    if(j%2==1)
                    {
                        printf("%d ",a[n][j]);
                    }
            }
        }
    return 0;
}