Cod sursa(job #263335)
Utilizator | Data | 20 februarie 2009 11:10:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
//Ciurul lui Eratostene
#include<iostream.h>
#include<string.h>
#include<conio.h>
int ok[30000], i, j, n;
void main()
{
clrscr();
cin>>n;
memset(ok,1,sizeof(ok));
for(i=2;i*i<=n;i++)
if(ok[i])
{
j=2;
while(i*j<=n)
{
ok[i*j]=0;
j++;
}
}
for(i=2;i<=n;i++)
if(ok[i]) cout<<i<<" ";
getch();
}