Cod sursa(job #160882)
Utilizator | Data | 17 martie 2008 10:48:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
FILE* f;
FILE* s;
long int i;
long int j;
char sir[2000000];
int main()
{
f=fopen ("ciur.in","r");
s=fopen ("ciur.out","w");
long int n;
fscanf (f,"%ld",&n);
long int cnt=0;
for (i=2;i<=n;i++)
{
if (sir[j]!='1')
cnt++;
for (j=i+i;j<=n;j+=i)
{
sir[j]='1';
}
}
fprintf (s,"%ld\n",cnt);
fcloseall();
return 0;
}