蓝桥杯算法训练：传球游戏代码实现.pdfVIP

C++

#includestdio.h

#includeiostream

usingnamespacestd;

intn,m;

intfun(intx)

{

if(x1)

returnx+n;

if(xn)returnx-n;

returnx;

}

intmain()

{intf[31][31]={0},i,j;

scanf(%d%d,n,m);

f[1][2]=f[1][n]=1;

for(i=2;i=m;i++)

for(j=1;j=n;j++)

f[i][j]=f[i-1][fun(j-1)]+f[i-1][fun(j+1)];

printf(%d,f[m][1]);

return0;

}

C

#includestdio.h

intn,m;

intat1(intx)

{

if(x1)returnx+n;

if(xn)returnx-n;

returnx;

}intmain()

{

intf[31][31]={0},i,j;

scanf(%d%d,n,m);

f[1][2]=f[1][n]=1;

for(i=2;i=m;i++)

for(j=1;j=n;j++)

f[i][j]=f[i-1][at1(j-1)]+f[i-1][at1(j+1)];

printf(%d,f[m][1]);

return0;

}

JAVA

importjava.util.Scanner;

publicclassMain{

publicstaticvoidmain(String[]args){

Scannerscan=newScanner(System.in);

intn=scan.nextInt();

intm=scan.nextInt();

scan.close();

int[][]a=newint[m][n];

a[0][n-1]=1;

a[0][1]=1;

for(inti=1;im;i++){

for(intj=0;jn;j++){

a[i][j]=a[i-1][(j-1+n)%n]+a[i-1][(j+1)%n];

}

}

System.out.println(a[m-1][0]);

}

}