#include <iostream>
#include"stdlib.h"
#include<iomanip>//io,manip是manipulator(操纵器)
//#include<cmath>
using namespace std;
int main()
{
//-----------寻找质数,A prime number is an integer greater than 1 that has
// exactly two divisors,1 and itself eg.2,3,5,7....
// integers that are not prime are called composite numbers;
// int num,i,count,n;
// cout<<"Enter max range:";
// cin>>n;
// for(num=1;num<=n;num++)
// {
//除了1之外,在num/2的范围内,如果能够除尽则计数加1,则不是素数
//如果除不尽,则count=0输出素数
// count=0;
// for(i=2;i<num/2;i++)
// {
// if(num%i==0)
// {
// count++;
// break;
// }
// }
// if(count==0&&num!=1)
// cout<<num<<setw(3)<<"\t";
// }
//--------------------------judge a number is prime
int num,i;
cout<<"判断是否是质数,请输入你的数字:"<<endl;
cin>>num;
if(num==1)
{
cout<<"the smallest prime is 2 "<<endl;
}
for(i=2;i<num;i++)
{
if(num%i==0)
{
cout<<"is not a prime number";
break;
}
}
if(num==i)
{
cout<<num<<"is a prime number"<<endl;
}
system("pause");
return 0;
}
C++学习之四判断质数素数
最新推荐文章于 2024-06-23 13:17:30 发布