Cod sursa(job #275478)
Utilizator | Data | 10 martie 2009 14:56:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<stdio.h>
long int n,p[32001],i,j,nr;
FILE *in=fopen("ciur.in","w");
FILE *out=fopen("ciur.in","w");
int main()
{
fprintf(in,"%ld",&nr);
for(i=2;i<=n;i++)
{
if(p[i]==0)
{
nr++;
for(j=i*i;j<=n;j+=i)
{
p[j]=1;
}
}
}
fprintf(out,"%ld",nr);
return 0;
}