Cod sursa(job #529334)
| Utilizator |  Miu Alexandra alexamiu2008 |
Data | 4 februarie 2011 18:51:46 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include<stdio.h>
FILE*fin,*fout;
long int nr,n,i;
int v[2000001];
int main(){
fin=fopen("ciur.in","r");
fout=fopen("ciur.out","w");
fscanf(fin,"%ld",&n);
long int j;v[1]=1;
for(i=1;i<=n;i++){
if(v[i]==0){nr++;
for(j=i*2;j<=n;j=j+i){v[j]=1;}
}
}
fprintf(fout,"%ld",nr);
return 0;}