Submission

xxxxxxxxxx

Score: 0

User: Jokul

Problemset: เทน้ำ

Language: c

Time: 0.001 second

Submitted On: 2025-04-17 14:04:20

#include <stdio.h>

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