AcWing 868. 筛质数（欧拉筛模板）

题目连接

https://www.acwing.com/problem/content/870/

思路

欧拉筛模板，学习链接：https://acmer.blog.csdn.net/article/details/122280910

代码

#include
using namespace std;
//----------------自定义部分----------------
#define ll long long
#define mod 1000000007
#define endl "\n"
#define PII pair
#define INF 0x3f3f3f3f

int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

ll ksm(ll a,ll b) {
	ll ans = 1;
	for(;b;b>>=1LL) {
		if(b & 1) ans = ans * a % mod;
		a = a * a % mod;
	}
	return ans;
}

ll lowbit(ll x){return -x & x;}

const int N = 2e6+10;
//----------------自定义部分----------------
int t,n,m,q,a[N];
bool vis[N];
int prime[N];

void get_prime(){
	vis[0] = vis[1] = true;
	for(int i = 2;i