法一
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n;
cin >> n;
for (int i = 2; i <= n; ++i)
{
int j;
for ( j = 2; j < n; ++j)
{
if (i%j == 0)
break;
}
if (i == j)
cout << i<<endl;
}
}
法二:(当j>根号i时,多余)
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main()
{
int n;
cin >> n;
for (int i = 2; i <= n; ++i)
{
int j;
for (j = 2; j <= sqrt(double(i)); ++j)
{
if (i%j == 0)
break;
}
if(j> sqrt(double(i)))
cout<<i<<endl;
}
return 0;
}
法三:(除去偶数)
#include<iostream>
#include<cmath>
#includ