Cod sursa(job #898258)
| Utilizator | Data | 28 februarie 2013 09:36:48 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<stdio.h>
FILE *in,*out;
int n,ciur[10001],i,j;
int main()
{
in=fopen("ciur.in","rt");
out=fopen("ciur.out","wt");
fscanf(in,"%d",&n);
for(i=2;i<=n;i++)
ciur[i]=1;
for(i=2;i*i<=n;i++)
{
if(ciur[i])
{
for(j=2;j*i<=n;j++)
{
ciur[j*i]=0;
}
}
}
for(i=2;i<=n;i++)
{
if(ciur[i])
fprintf(out,"%d \n",i);
}
fclose(in);
fclose(out);
return 0;
}
