Cod sursa(job #188711)
Utilizator | Data | 9 mai 2008 18:50:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<iostream.h>
#define NMax 1000
int main()
{
freopen ("ciur.in","r",stdin);
freopen ("ciur.out","w",stdout);
int ciur[NMax], n, i, j;
scanf("%d",&n);
for(i=2;i<n;i++)
ciur[i]=1;
for(i=2;i*i<=n;i++)
if(ciur[i])
for(i=2;j*i<n;j++)
ciur[i*j]=0;
for(i=2;i<n;i++)
if(ciur[i])
printf("%d/n",i);
return 0;
}