Cod sursa(job #163875)
Utilizator | Data | 23 martie 2008 11:35:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
#include<string.h>
char v[2000005];
int main ()
{ long n,i,j,cant=0;
FILE*f=fopen("ciur.in","r");
FILE*g=fopen("ciur.out","w");
fscanf(f,"%ld",&n);
memset(v,'1',n);
for (i=2;i<=n;++i)
{ if (v[i]=='1')
++cant;
for (j=i+i;j<=n;j+=i)
v[j]='0';
}
fprintf(g,"%ld\n",cant);
fcloseall();
return 0;
}