摘要:
Safecracker#include #include #include #include using namespace std;int OK=1;int cmp(const void* a,const void * b){ return *(char*)b-*(char *)a;}void dfs(int cur,int n,int target,int* a,int* b,int* ... 阅读全文
摘要:
Backward Digit Sums事情先是这样的:#include using namespace std;int b[15];int OK=1;void sumpermutation(int* a,int n){ for(int i=n-1;i>0;i--) { for(int j=0;j>n>>m; OK=1; permutation(a,vis,n,... 阅读全文