【HDU】5901】【模板题】Count primes 【Meisell-Lehmer求质数个数】
来源:互联网 发布:摇头丸淘宝黑话 编辑:程序博客网 时间:2024/06/05 16:28
传送门:HDU5901
描述:
Count primes
Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 704 Accepted Submission(s): 350
Problem Description
Easy question! Calculate how many primes between [1...n]!
Input
Each line contain one integer n(1 <= n <= 1e11).Process to end of file.
Output
For each case, output the number of primes in interval [1...n]
Sample Input
2310
Sample Output
124
Source
2016 ACM/ICPC Asia Regional Shenyang Online
Recommend
wange2014 | We have carefully selected several similar problems for you: 5899 5897 5896 5894 5893
题意:
求区间
思路:
模板题,上两个模板
相关知识见WIKI
代码一:
复杂度大概O(n^(3/4))
//G++ 1560ms 6544k#include <bits/stdc++.h>#define ll long longusing namespace std;ll f[340000],g[340000],n;void init(){ ll i,j,m; for(m=1;m*m<=n;++m)f[m]=n/m-1; for(i=1;i<=m;++i)g[i]=i-1; for(i=2;i<=m;++i){ if(g[i]==g[i-1])continue; for(j=1;j<=min(m-1,n/i/i);++j){ if(i*j<m)f[j]-=f[i*j]-g[i-1]; else f[j]-=g[n/i/j]-g[i-1]; } for(j=m;j>=i*i;--j)g[j]-=g[j/i]-g[i-1]; }}int main(){ while(scanf("%I64d",&n)!=EOF){ init(); cout<<f[1]<<endl; } return 0;}
代码二:
复杂度O(n^(2/3))
//Meisell-Lehmer//G++ 218ms 43252k#include<cstdio>#include<cmath>using namespace std;#define LL long longconst int N = 5e6 + 2;bool np[N];int prime[N], pi[N];int getprime(){ int cnt = 0; np[0] = np[1] = true; pi[0] = pi[1] = 0; for(int i = 2; i < N; ++i) { if(!np[i]) prime[++cnt] = i; pi[i] = cnt; for(int j = 1; j <= cnt && i * prime[j] < N; ++j) { np[i * prime[j]] = true; if(i % prime[j] == 0) break; } } return cnt;}const int M = 7;const int PM = 2 * 3 * 5 * 7 * 11 * 13 * 17;int phi[PM + 1][M + 1], sz[M + 1];void init(){ getprime(); sz[0] = 1; for(int i = 0; i <= PM; ++i) phi[i][0] = i; for(int i = 1; i <= M; ++i) { sz[i] = prime[i] * sz[i - 1]; for(int j = 1; j <= PM; ++j) phi[j][i] = phi[j][i - 1] - phi[j / prime[i]][i - 1]; }}int sqrt2(LL x){ LL r = (LL)sqrt(x - 0.1); while(r * r <= x) ++r; return int(r - 1);}int sqrt3(LL x){ LL r = (LL)cbrt(x - 0.1); while(r * r * r <= x) ++r; return int(r - 1);}LL getphi(LL x, int s){ if(s == 0) return x; if(s <= M) return phi[x % sz[s]][s] + (x / sz[s]) * phi[sz[s]][s]; if(x <= prime[s]*prime[s]) return pi[x] - s + 1; if(x <= prime[s]*prime[s]*prime[s] && x < N) { int s2x = pi[sqrt2(x)]; LL ans = pi[x] - (s2x + s - 2) * (s2x - s + 1) / 2; for(int i = s + 1; i <= s2x; ++i) ans += pi[x / prime[i]]; return ans; } return getphi(x, s - 1) - getphi(x / prime[s], s - 1);}LL getpi(LL x){ if(x < N) return pi[x]; LL ans = getphi(x, pi[sqrt3(x)]) + pi[sqrt3(x)] - 1; for(int i = pi[sqrt3(x)] + 1, ed = pi[sqrt2(x)]; i <= ed; ++i) ans -= getpi(x / prime[i]) - i + 1; return ans;}LL lehmer_pi(LL x){ if(x < N) return pi[x]; int a = (int)lehmer_pi(sqrt2(sqrt2(x))); int b = (int)lehmer_pi(sqrt2(x)); int c = (int)lehmer_pi(sqrt3(x)); LL sum = getphi(x, a) +(LL)(b + a - 2) * (b - a + 1) / 2; for (int i = a + 1; i <= b; i++) { LL w = x / prime[i]; sum -= lehmer_pi(w); if (i > c) continue; LL lim = lehmer_pi(sqrt2(w)); for (int j = i; j <= lim; j++) sum -= lehmer_pi(w / prime[j]) - (j - 1); } return sum;}int main(){ init(); LL n; while(~scanf("%lld",&n)) { printf("%lld\n",lehmer_pi(n)); } return 0;}
0 0
- 【HDU】5901】【模板题】Count primes 【Meisell-Lehmer求质数个数】
- [hdu5901 Count primes]Meisell-Lehmer求质数个数PI(X)
- HDU 5901 Count primes (Meisell-Lehmer算法 -- 模板)
- hdu 5901 Count primes(Meisell-Lehmer 统计n(很大)以内的素数个数)
- HDU5901 Count primes(Meisell-Lehmer算法+模板)
- hdu5901Count primes+Lehmer求1-n的质数个数
- HDU 5901 Count primes (求1e11内素数个数、模板题....)
- 【模板】Meisell-Lehmer 模板
- HDU 5901 Count primes(求1e11内素数个数模板)
- Meisell-Lehmer算法(求1...n范围内的素数个数)
- hdu-5901-Count primes(求1~n内素数个数)
- HDU --- 5901 Count primes 【求1e11内的素数模板题】
- HDU 5901 Count primes (区间素数个数)
- Count Primes (质数的个数)
- HDU 5901 Count primes 2016年沈阳网络赛 (Lehmer素数计数)
- Meisell-Lehmer算法(大素数模板)
- HDU 5901 Count primes (大素数模板题)
- HDU 5901 Count primes (求1e11内素数个数)
- Javascript中apply、call、bind比较
- Python3:网络爬虫(1)
- 遍历python字典几种方法
- 基础知识之PDO预处理
- 树链剖分学习
- 【HDU】5901】【模板题】Count primes 【Meisell-Lehmer求质数个数】
- 【50.40%】【BZOJ 4553】[Tjoi2016&Heoi2016]序列
- C++ Primer Plus (Six Edition) Chapter 4, Review
- INSERT IGNORE 与INSERT INTO的区别
- Chapter 7: Sparse kernel Machines
- mysql select ... update 使用方式
- 第四周项目4 - 建设双链表算法库
- 关于python学习路线
- 芒果iOS开发之Xcode8控制台输出警告:subsystem: com.apple.UIKit, category: HIDEventFiltered, enable_level: 0