Cod sursa(job #539076)
Utilizator | Data | 22 februarie 2011 13:15:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
#include<bitset>
using namespace std;
FILE *in=fopen("ciur.in","rt");
FILE *out=fopen("ciur.out","wt");
bitset<2000001> prim;
int i,j,n,cont;
int main()
{
fscanf(in,"%d",&n);
cont=1;
for(i=3;i<=n;i+=2)
{
if(!prim[i])
{
for(j=i<<1;j<=n;j+=i)
prim[j]=true;
cont++;
}
}
fprintf(out,"%d",cont);
}