Cod sursa(job #1426400)

Utilizator ButnaruButnaru George Butnaru Data 29 aprilie 2015 17:28:46
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.34 kb
#include <stdio.h>
#include <bitset>
using namespace std;
int n,i,nr,j;
bitset <2000001> t;
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n); nr=n-1;
for (i=2;i*i<=n;i++)
   if (t[i]==0) {
    for (j=i*i;j<=n;j+=2*i) {
        if (t[j]==0) nr=nr-1; t[j]=1;
   }
}
printf("%d\n",nr);
return 0;
}