Cod sursa(job #352996)
Utilizator | Data | 3 octombrie 2009 21:10:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
#include <stdlib.h>
char p[1000000];
int main()
{
long n=0, i, j;
freopen("prime.in", "r", stdin);
freopen("prime.out", "w", stdout);
scanf("%ld", &n);
if(n>=2)
printf("2 ");
for(i=1; i<n/2; i++)
{
if(p[i]==0)
{
printf("%ld ", 2*i+1);
for(j=2*i*i+2*i; i<=1000 && j<n; j+=2*i+1)
p[j]=1;
}
}
return 0;
}