杭电
文章平均质量分 58
Bob__Huang
xjb搞
展开
-
HDU 2682 Tree
单击666传送 TreeProblem Description There are N (2<=N<=600) cities,each has a value of happiness,we consider two cities A and B whose value of happiness are VA and VB,if VA is a prime number,or VB is a p原创 2017-03-30 12:56:58 · 549 阅读 · 0 评论 -
hdu2682 TREE 素数,最小生成树
单击666传送 TreeProblem Description There are N (2<=N<=600) cities,each has a value of happiness,we consider two cities A and B whose value of happiness are VA and VB,if VA is a prime number,or VB is a p原创 2017-04-04 12:12:43 · 600 阅读 · 0 评论 -
数论
0 or 1 Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3708 Accepted Submission(s): 1077Problem Description Solving problem is a interesti原创 2017-04-14 20:34:53 · 372 阅读 · 0 评论