Cod sursa(job #398699)
Utilizator | Data | 19 februarie 2010 10:40:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
//
#include<stdio.h>
FILE *f=fopen("ciur.in","r"), *g=fopen("ciur.out","w");
bool v[2000001];
long k,i,j,pozp,p,n,ctr;
int main()
{
fscanf(f,"%ld", &n);
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i])
{
++k;
for(j=2*i;j<=n;j=j+i)
v[j]=0;
}
fprintf(g,"%ld",k);
fclose(f);
fclose(g);
return 0;
}