题解
-Dong
本博客转载或复制的内容只作为自己复习回顾用,无意触犯原出处。
展开
-
Button Bashing 题解补充oj25439
escriptionYou recently acquired a new microwave, and noticed that it provides a large number of buttons to be able to quickly specify the time that the microwave should be running for. There are butto...原创 2018-04-26 11:17:29 · 610 阅读 · 0 评论 -
Jury Jeopardy 图的四方向的变换
Jury JeopardyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 52 Accepted Submission(s): 16DescriptionWhat would a programming contest be wi...原创 2018-04-26 21:46:41 · 267 阅读 · 0 评论 -
Beautiful Trees Cutting ——拓展欧几里得求逆元以及快速幂
链接:https://www.nowcoder.com/acm/contest/106/B来源:牛客网It’s universally acknowledged that there’re innumerable trees in the campus of HUST. One day Xiao Ming is walking on a straight road and sees m...原创 2018-04-30 23:20:00 · 378 阅读 · 0 评论 -
HDU 1059 Dividing——多重背包变形
DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29789 Accepted Submission(s): 8472Problem DescriptionMarsha and Bill own a collection...原创 2018-05-25 17:17:06 · 286 阅读 · 0 评论 -
hdu 5723 Abandoned country 深搜回溯
题目链接:hdu 5723 参考博客:https://www.cnblogs.com/aiguona/p/7214707.html题意:给出n个顶点,m条边,让你建一颗最小生成树,问:最小生成树的值是多少,任意两点的期望长度是多少? 题解: 任意两点的期望是(权值)*(这条路被走过的次数)的总和 除以 总共的路径数。 比如从A到B距离为2,从B到C距离...原创 2018-10-08 16:56:31 · 134 阅读 · 0 评论