Cod sursa(job #1541932)
Utilizator | Data | 4 decembrie 2015 18:49:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <bitset>
#define NMAX 2000005
using namespace std;
int n,nr=1;
bitset <NMAX>ap;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for (int i=3;i<=n;i+=2)
if (!ap[i]){
nr++;
for (long long j=1LL*i*i;j<=n;j+=i)ap[j]=1;
}
printf("%d",nr);
fclose(stdin);
fclose(stdout);
}