Cod sursa(job #649822)
Utilizator | Data | 16 decembrie 2011 20:02:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<stdio.h>
int v[2000001];
long int n,i,j,k;
int main()
{FILE *fin,*fout;
fin=fopen("ciur.in","r");
fout=fopen("ciur.out","w");
fscanf(fin,"%ld",&n);
v[1]=1;
for(i=2;i<=n;i++)
if(v[i]==0)
{k++;
for(j=i;j<=n;j=j+i)
v[j]=1;
}
fprintf(fout,"%ld",k);
fclose(fin);
fclose(fout);
return 0;
}