给出杨辉三角的顶点值，求底边各个数的值。直接DFS就好了
#include #include #include #include #include #include #include #include #include #include #define ll __int64 #define INF 0x3fffffff #define rep(i,n) for(int (i)=0;(i) >n>>sum; k=0; memset(a,0,sizeof(a)); memset(vis,false,sizeof(vis)); dfs(0); rep(i,n) { cout<