Bzoj 1197 HNOI2006 Flower Fairy's magic recursion

The main idea: to find the n-dimensional space of M ball can be divided into how many areas of space

The VFK: http://vfleaking.blog.163.com/blog/static/174807634201321193348312/

See for yourself ....

I'm still in the tangle of 0-dimensional space to put in a 0-dimensional ball after the space will be divided into several ....

#include <cstdio> #include <cstring> #include <iostream> #include <algorithm>using namespace Std;long Long f[20][110];int m,n;int main () {int i,j;cin>>m>>n;f[0][0]=1;for (j=1;j<=m;j++) f[0][j]=2; for (i=1;i<=n;i++) {f[i][0]=1;for (j=1;j<=m;j++) f[i][j]=f[i][j-1]+f[i-1][j-1];} Cout<<f[n][m]<<endl;return 0;}

Bzoj 1197 HNOI2006 Flower Fairy's magic recursion