Count primes (模板题)
来源:互联网 发布:淘宝u站刷粉丝软件 编辑:程序博客网 时间:2024/06/10 11:47
Count primes
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
题意:
真的很easy啊。。。求[1~n]之间的素数个数,只不过n有点大,1e11
解题思路:
毛线的解题思路,还不是模板啊,自己又不会。
Code:
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <vector>#include <cmath>#define MAXN 100 // pre-calc max n for phi(m, n)#define MAXM 10010 // pre-calc max m for phi(m, n)#define MAXP 40000 // max primes counter#define MAX 400010 // max prime#define setbit(ar, i) (((ar[(i) >> 6]) |= (1 << (((i) >> 1) & 31))))#define chkbit(ar, i) (((ar[(i) >> 6]) & (1 << (((i) >> 1) & 31))))#define isprime(x) (( (x) && ((x)&1) && (!chkbit(ar, (x)))) || ((x) == 2))using namespace std; long long dp[MAXN][MAXM]; unsigned int ar[(MAX >> 6) + 5] = { 0 }; int len = 0, primes[MAXP], counter[MAX]; void Sieve() { setbit(ar, 0), setbit(ar, 1); for (int i = 3; (i * i) < MAX; i++, i++) { if (!chkbit(ar, i)) { int k = i << 1; for (int j = (i * i); j < MAX; j += k) setbit(ar, j); } } for (int i = 1; i < MAX; i++) { counter[i] = counter[i - 1]; if (isprime(i)) primes[len++] = i, counter[i]++; } } void init() { Sieve(); for (int n = 0; n < MAXN; n++) { for (int m = 0; m < MAXM; m++) { if (!n) dp[n][m] = m; else dp[n][m] = dp[n - 1][m] - dp[n - 1][m / primes[n - 1]]; } } } long long phi(long long m, int n) { if (n == 0) return m; if (primes[n - 1] >= m) return 1; if (m < MAXM && n < MAXN) return dp[n][m]; return phi(m, n - 1) - phi(m / primes[n - 1], n - 1); } long long Lehmer(long long m) { if (m < MAX) return counter[m]; long long w, res = 0; int i, a, s, c, x, y; s = sqrt(0.9 + m), y = c = cbrt(0.9 + m); a = counter[y], res = phi(m, a) + a - 1; for (i = a; primes[i] <= s; i++) res = res - Lehmer(m / primes[i]) + Lehmer(primes[i]) - 1; return res; }int main(){ init(); long long int n; while(scanf("%lld",&n)!=EOF) { printf("%lld\n",Lehmer(n)); } return 0;}
阅读全文
0 0
- Count primes (模板题)
- HDU 5901 Count primes (大素数模板题)
- 【HDU5901】Count primes(大素数模板)
- HDU 5901 Count primes (求1e11内素数个数、模板题....)
- HDU-5901-Count primes(大素数模板)
- HDU 5901 Count primes (Meisell-Lehmer算法 -- 模板)
- hdu 5901 Count primes (大素数模板)
- hdu 5901 Count primes (大素数模板)
- HDU5901 Count primes(Meisell-Lehmer算法+模板)
- Leetcode 204题 Count Primes
- Leetcode(204) Count Primes
- Leetcode(59)-Count Primes
- 204. Count Primes(unsolved)
- 204. Count Primes(埃拉托色尼)
- Count Primes
- Count Primes
- Count Primes
- Count Primes
- PL/SQL使用SQLServer字体
- java深入学习二之关键字
- 简单路径问题(点和斜杠)
- Redis 内存淘汰机制
- Redis应用场景详解
- Count primes (模板题)
- Java 设计模式
- python3 为类动态添加静态(类)方法 类名.方法名=方法名
- Scala 高阶函数
- mysql 基准测试-01
- win系统上安装VMware,设置为同一个局域网
- 【模板】树状数组1
- Java 静态导入
- hdu 5074 dp