Algobird

Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29755    Accepted Submission(s): 13268Problem DescriptionA ring is

Fire NetTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6995    Accepted Submission(s): 3971Problem DescriptionSuppose that we have

Sum It UpTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4623    Accepted Submission(s): 2390Problem DescriptionGiven a specified to

题目链接：http://codeforces.com/problemset/problem/24/A发现写dfs写得特别烂。题目要求一个最小代价环。题目数据意思是比如给了1，3，1那么表示路方向由1->3调整为3->1的代价是1，如果不去调整就不需要代价。#include using namespace std;const int maxn = 105;const

hdu 1455 ： http://acm.hdu.edu.cn/showproblem.php?pid=1455这道题是大一学习dfs时学习的，但是发现自己现在还是不会写，写着写着超时了。主要是两个剪枝想不到了，代码中给注释了。网上也有好多这道题的做法，我不多说了。用的是没有返回值的dfs。剪枝1：答案必须是sum的约数。剪枝2：从大到小排序减小递归深度。剪枝3：例如某个组合