欧拉素数筛选

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;

const int MAXN=1150;
int prime[MAXN];//存储
bool vis[MAXN];//标记数组
int cnt=0;
void Prime()//核心
{
    memset(vis,0,sizeof(vis));
    for(int i=2;i < MAXN; i++)
    {
        if(!vis[i])
        prime[cnt++]=i;
        for(int j=0;j<cnt&&i*prime[j]<MAXN;j++)
        {
            vis[i*prime[j]]=1;
            if(i%prime[j]==0)
            break;
        }
    }
}

int main() {
    int n, x, result;
    Prime();
    scanf("%d", &n);
    while(n--) {
        scanf("%d", &x);
        int biao = lower_bound(prime, prime+cnt, x) - prime;//注意减去指针得到下标
        if(prime[biao] == x)
            printf("%d\n", x);
        else {
            printf("%d\n", abs(prime[biao] - x) > abs(prime[biao-1] - x) ? prime[biao-1] : prime[biao]);
        }
    }
}