![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
大素数筛
抠脚老騷
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #708 (Div. 2)
Codeforces Round #708 (Div. 2)E1 - Square-free division (easy version)素数筛,分解质因数#include <bits/stdc++.h>#pragma GCC optimize(2)using namespace std;#define int long longtypedef long long LL;typedef long long ll;const int INF = 0x3f3f3f3f;con原创 2021-03-20 20:53:33 · 140 阅读 · 1 评论 -
素数模板
hdu 5901 Count primes (大素数模板)Count primes 复杂度大概O(n^(3/4))#include <bits/stdc++.h> #define ll long long using 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原创 2020-08-10 14:57:06 · 530 阅读 · 0 评论