min25筛前n项素数个数的板子
ll s[320010];ll a[320010];ll b[320010];double inv[320010];inline ll Prime(ll N) { ll S = sqrt(N); for (int i = 1; i <= S; ++i) a[i] = i, s[i] = i, b[i] = N / i, inv[i] = 1.0 / i; s[S + 1] = S + 1, s[S + 2] = S + 2; for (int p = 2; p
原创
2020-10-17 19:33:15 ·
336 阅读 ·
0 评论