hdu-5901-Count primes(求1~n内素数个数)
来源:互联网 发布:赵泓霖网络课下载 编辑:程序博客网 时间:2024/06/10 04:31
Count primes
Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
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
2
3
10
Sample Output
1
2
4
题意:
求1~n内素数个数。
题目链接:Count primes
解题思路:
转自博客http://blog.csdn.net/chaiwenjun000/article/details/52589457
还有 http://m.blog.csdn.net/article/details?id=51314679
感觉看不懂,好弱......
只能开个贴收藏一下了。
代码:
//Meisell-Lehmer
#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;}
#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;}
0 0
- hdu-5901-Count primes(求1~n内素数个数)
- 求1-1e11内的素数个数(HDU 5901 Count primes )
- HDU 5901 Count primes (求1e11内素数个数)
- HDU 5901 Count primes (求1e11内素数个数、模板题....)
- HDU 5901 Count primes(求1e11内素数个数模板)
- HDU 5901 Count primes (区间素数个数)
- HDU --- 5901 Count primes 【求1e11内的素数模板题】
- HDU 5901 Count primes(1e11以内的素数个数)
- hdu 5901 Count primes(Meisell-Lehmer 统计n(很大)以内的素数个数)
- 204.Count Primes(1-N中,素数的个数)
- HDU 5901-Count primes(1e11以内素数的个数)
- 计算素数个数 Count Primes
- [LeedCode]Count Primes素数个数
- [LeetCode]Count Primes素数个数
- leetcode Count Primes 素数个数
- 【HDU】5901】【模板题】Count primes 【Meisell-Lehmer求质数个数】
- HDU 5901 1-n中素数个数
- hdu 5901 (1-n 素数个数)
- 项目总结 -- RFID 读写器上位机软件
- Map ,HashMap , TreeMap , TreeMap 默认排序
- JDK各版本发布时间表
- 品茗论道说广播(Broadcast内部机制讲解)
- html5 浏览器端存储常用技巧总结
- hdu-5901-Count primes(求1~n内素数个数)
- 小谈 " j = j++ ; "
- Flume集群搭建
- [HDU 5880] Family View (AC自动机)
- 函数INIT_DELAYED_WORK() / queue_delayed_work()
- 基于FPGA的按键控制LED的循环左移一位
- web前端-HTML列表-012
- NTU深度学习笔记3
- VS编译时,输出文件不能改写