Submission

P-xxxxxxxx

Score: 10

User: Jokul

Problemset: เทน้ำ

Language: c

Time: 0.002 second

Submitted On: 2025-04-18 18:11:52

#include <stdio.h>

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


    }

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