素数判定 扳子

#include <iostream>#include <string>#include <cstring>#include <stdio.h>#include <cmath>#include<cstdio>#include<cstring>#include<cmath>#define MA 100001bool prim[MA];int main(){    int i,j,t,n;    memset(prim,true,sizeof(prim));    for (i=2;i<sqrt(MA);i++)    {        if (prim[i])        {            for (j=i*i;j<MA;j=j+i)            prim[j]=false;        }    }    scanf("%d",&t);    while (t--)    {        scanf("%d",&n);        if (n<100001)        {            if (prim[n])            printf("Yes\n");            else            printf("No\n");        }        else        {            bool fafe=true;            int p=sqrt(n);            for (i=2;i<=p;i++)            if (prim[i]&&n%i==0)            {                fafe=false;                break;            }            if (fafe)            printf("Yes\n");            else            printf("No\n");        }    }    return 0;}