题目1047：素数判定

#include <iostream> #include <stdio.h> #include <algorithm> #include <math.h> using namespace std; //1047 素数判定 bool isPrime(int n){     if(n<=1) return false;     if(n==2||n==3) return true;     for(int i=2;i<=sqrt(n);i++)         if(n%i==0) return false;     return true; } int main(){     int n;     while(scanf("%d",&n)!=EOF){         if(isPrime(n)) printf("yes\n");         else           printf("no\n");     }     return 0; } /**************************************************************     Problem: 1047     User: cust123     Language: C++     Result: Accepted     Time:0 ms     Memory:1532 kb ****************************************************************/