题解 | 素数判定

#include <stdio.h>
int prime(int n){
    for(int i=2;i<=n/2;i++)
    if(n%i==0)
    return 0;
    return 1;
}
int main() {
    int num;
    while(scanf("%d",&num)!=EOF){
        if(num==1)
        {printf("no\n");continue;}
        if(prime(num))
            printf("yes\n");
        else 
         printf("no\n");
    }
    return 0;
}