Cod sursa(job #1153042)
Utilizator | Data | 25 martie 2014 10:50:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
#include <stdlib.h>
int v[2000001];
int main()
{
FILE *fin, *fout;
int n,c,i,nr;
fin=fopen("ciur.in","r");
fscanf(fin,"%d",&n);
fclose(fin);
nr=1;
for(i=3;i<=n;i=i+2){
if(v[i]==0){
for(c=i+i+i+1;c<=n;c=c+i)
v[c]=1;
nr++;
//printf("%d\n",i);
}
}
fout=fopen("ciur.out","w");
fprintf(fout,"%d",nr);
fclose(fout);
return 0;
}