++ ‘s blog

#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int f1,f2;//挑战成功只有一种情况，就是较小数分解成功，大数失败void dfs(

/*参考：http://blog.youkuaiyun.com/chinaczy/article/details/5341771还需加强对dfs 递归的理解*/#include#include#includeusing namespace std;int n,k,total;int vis[10];char mmap[10][10];void dfs(int l, int cnt){

一开始TLE，加了剪枝后不断WA，一直没找出原因 = = ！暂时贴上保存了#include#include#include#includeusing namespace std;struct ss{ int val; int sum;};ss a[22];int tol,s,cnt;int cmp(ss a,ss b){ return a.va

ZOJ36071. 要注意dx dy 与 edge中四个fagxix

ZOJ2913