摘要：
递推无疑 g[1][1]=1; for(int i=2;i<=100;i++) { int tmp=1; for(int j = 1 ; j < i ; j++) { tmp += g[i-1][j]; g[i][j] = tmp; } g[i][i]=g[i][i-1]; } 递推方程Train Problem IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (... 阅读全文
