//鉴别1到1000以内的素数
#include <iostream>
using namespace std;
int main()
{
int n = 2;
cout<<"The prime number between 1 to 1000 are:"<<endl;
while (n<=1000)
{
for (int i=2; i<n/2; i++)
{
if(n % i)//n不能被i整除,测试下一个i值(即i+1)
continue;
else//n可以被i整除,结束for循环,测试下一个n值
goto a1;
}
cout<<n<<endl;
a1: n++;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int n = 2;
cout<<"The prime number between 1 to 1000 are:"<<endl;
while (n<=1000)
{
for (int i=2; i<n/2; i++)
{
if(n % i)//n不能被i整除,测试下一个i值(即i+1)
continue;
else//n可以被i整除,结束for循环,测试下一个n值
goto a1;
}
cout<<n<<endl;
a1: n++;
}
return 0;
}
希望和大家多交流,谢谢