cccrown的专栏

#include using namespace std; int a[21][21]; int n, m; int sx, sy, gx, gy; int res; void dfs(int k, int x, int y, int d) { if(k>10) return; if(d==-1) a[x+1][y]=0; if(d==-2) a[x-1][y]=0;

Aizu 0558 POJ 3669 Aizu 0121 POJ 2718

POJ3046 题意:多重集组合问题 dp[i][j]=dp[i][j-1]+dp[i][j-i]