![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
hdu
fufck
这个作者很懒,什么都没留下…
展开
-
hdu 5726
GCD Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 4549 Accepted Submission(s): 1630 Problem Description Give you a sequence o原创 2018-01-05 22:04:06 · 141 阅读 · 0 评论 -
hdu 2586
How far away ?Problem DescriptionThere are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like this "How far is it if I want to go from house ...原创 2018-03-22 16:28:07 · 135 阅读 · 0 评论 -
莫比乌斯反演题目总结
之前的小结:https://blog.csdn.net/fufck/article/details/78844309 1.bzoj2301 题意:满足a≤x≤b ,c≤y≤d,且gcd(x,y) = k 的个数(1≤n≤50000,1≤a≤b≤50000,1≤c≤d≤50000,1≤k≤50000) 思路:f(n)表示gcd恰好为n的个数,F(n)表示n|gcd的个数...原创 2018-07-30 14:44:55 · 838 阅读 · 0 评论 -
hdu 4747(DP?线性递推)
Mex Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 3876 Accepted Submission(s): 1290 Prob...原创 2018-09-04 13:47:14 · 618 阅读 · 0 评论 -
HDU 3092 Least common multiple(完全背包+思维)
题目链接 题目大意:给你一个数n,你要将它分成若干数字的和,使其的lcm最大,并且对p取模 思路:有一个很显然的性质:分成的若干个数字的必定互质。之后就是完全背包问题了。F[I]表示和为I的得到的最大lcm,F[I]=max(F[I-prime[j]*k]*k*prime[j]) 因为F[I]的值可能超过long long范围,我们就对其取一个log,记为数组DP【】 #include&...原创 2018-09-05 23:10:51 · 197 阅读 · 0 评论