#include<cstdio>
#include<algorithm>
#include<iostream>
#include<vector>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long ll;
const int mxm=2e5+5;
const ll N=1e10+5;
bool isprime[mxm];
ll prime[mxm],w[mxm],id1[mxm],id2[mxm];
ll num_pri=0;
ll m=0;
ll sump[mxm];
__int128 g[mxm];
__int128 cal(ll x){
return
数论:min25筛求素数个数
最新推荐文章于 2023-01-19 17:29:00 发布