【解题报告】传球游戏

#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#include<iostream>#define LOC#define maxn 110using namespace std;int m,n;int f[maxn][maxn];//f[i][j]->i次在j手中的方案个数 void dp(){for(int i=1;i<=m;i++)//阶段{for(int j=1;j<=n;j++)//状态 {if(j==1)f[i][j]=f[i-1][n]+f[i-1][2];else if(j==n)f[i][j]=f[i-1][n-1]+f[i-1][1];else f[i][j]=f[i-1][j-1]+f[i-1][j+1];}}}int main(){#ifdef LOCfreopen("ball.in","r",stdin);freopen("ball.out","w",stdout);#endifscanf("%d %d",&n,&m);f[0][1]=1;dp();printf("%d\n",f[m][1]);return 0;}