乐于消遣的专栏

用状态数组来剪枝的一种方法# include# include # include int dfs(long ans,int cur); int range(long a); long number[105],que; int n,vis[64010][110]; char record[105]; int main() { int test; scanf("%d",&test); re

# include # include # include using namespace std; int judge(int length); int dfs(int cur,int sum,int length,int deep); int queue(int deep,int length); int n,stick[105],vis[105],be_used[105]; int ma