BZOJ
文章平均质量分 60
CyuuniChin
这个作者很懒,什么都没留下…
展开
-
[BZOJ 1053] [HAOI2007]反素数ant 数论+搜索
题目大意:求最大反质数 题解见黄学长:题解 #include #include #include using namespace std; int p[12]={1,2,3,5,7,11,13,17,19,23,29,31},ans(1),n,sum(1); int Dfs(int k,long long num,int cnt,int e) { if(k==12原创 2015-10-14 21:24:42 · 289 阅读 · 0 评论 -
[BZOJ 2301][HAOI2011] Problem b 莫比乌斯反演
题目大意:求n次询问a<=x<=b,c<=y<=d,使得Gcd(x,y)=k;推导详见popoqqq大神orz:http://blog.csdn.net/popoqqq/article/details/41957687 ∑1<=x<=n∑1<=y<=mGCD(x,y)=k⇒∑1<=x<=nk∑1<=y<=mk[GCD(x,y)=1]⇒∑1<=x<=nk∑1<=y<=mk∑d|gcd(x,y)μ(d原创 2015-10-18 21:33:30 · 316 阅读 · 0 评论