第1个回答 推荐于2016-08-27
#include <iostream>
#include <cmath>
using namespace std;
bool isPrime(int n)
{
if(n<=1)return false;
if(n==2)return true;
for(int i=2;i<=sqrt(n);i++)if(n%i==0)return false;
return true;
}
int main()
{
int n;
cout<<"please input n"<<endl;
cin>>n;
if(isPrime(n))cout<<n<<" is a prime number"<<endl;
else
cout<<n<<" is not a prime number"<<endl;
return 0;
}本回答被提问者采纳