Cod sursa(job #616591)
| Utilizator | Data | 12 octombrie 2011 21:39:52 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.28 kb |
#include <stdio.h>
FILE*fin,*fout;
int i,j,nr,k,n;
char v[2000001];
int main()
{
fin=fopen("ciur.in","r");
fout=fopen("ciur.out","w");
fscanf(fin,"%d",&n);
for(i=2;i<=n;i++){
if(v[i]==0){nr++;
for(j=2*i;j<=n;j=j+i){v[j]=1;}
}
}
fprintf(fout,"%d",nr);
return 0;
}
