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