Cod sursa(job #522876)
Utilizator | Data | 16 ianuarie 2011 15:25:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<cstdio>
FILE *fin=fopen("ciur.in","r");
FILE *fout=fopen("ciur.out","w");
int a[1000001],i,j,k=1,n;
int main(){
fscanf(fin,"%d",&n);
if(i%2==0) n--;
for(i=1;i<=n/2;i++)
a[i]=2*i+1;
for(i=1;i<=n/2;i++)
if(a[i]){
for(j=i+2*i+1;2*j+1<=n;j+=2*i+1)
a[j]=0;
k++;
}
fprintf(fout,"%d",k);
return 0;
}