Cod sursa(job #1824978)
Utilizator | Data | 8 decembrie 2016 17:17:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
#include <stdlib.h>
#define MAX 2000000
int v[MAX];
int n;
int main()
{
int i,j;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=n;i++)
if(!v[i])
for(j=i+i;j<=n;j=j+i)
v[i]=1;
for(i=2;i<=n;i++)
printf("%d ",v[i]);
return 0;
}