Cod sursa(job #1921586)
Utilizator | Data | 10 martie 2017 13:22:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
bitset <2000003>a;
int main()
{
int n , cnt ,j ,i ;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
a[1]=1;
for(i=2;i<=n;i++)
if(a[i]==0)
for(j=i+i;j<=n;j=j+i)
a[j]=1;
cnt=0;
for(i=2;i<=n;i++)
if(a[i]==0) cnt++;
fout<<cnt;
fout.close();
return 0;
}