Pagini recente » Cod sursa (job #309985) | Cod sursa (job #2865433) | Cod sursa (job #2785667) | Cod sursa (job #744970) | Cod sursa (job #569271)
Cod sursa(job #569271)
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int p[100000], n, i, j;
fin >> n;
for ( i = 1; i <= n; i++ )
p[i] = 1;
p[1] = 0;
for ( i = 2; i * i <= n; i++ )
if (p[i] == 1)
for ( j = i * 2; j <= n; j = j + i)
p[j] = 0;
for ( i = 1; i <= n; i++)
if(p[i]==1) fout << i << " ";
fin.close();
fout.close();
return 0;
}