Cod sursa(job #216220)
| Utilizator | Data | 23 octombrie 2008 14:23:15 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
using namespace std;
#include<stdio.h>
#include<bitset>
FILE *f=fopen("ciur.in","r"),
*g=fopen("ciur.out","w");
bitset<2000007>a;
int n,j,nr;
long long i;
int main()
{ fscanf(f,"%d",&n);
nr=1;
for(i=3;i*i<=n;i+=2) if(a[i]==0) { for(j=i*i;j<=n;j+=i) a[j]=1;
++nr;
}
fprintf(g,"%d\n",nr);
fclose(f);
fclose(g);
return 0;
}
