Cod sursa(job #1827893)
Utilizator | Data | 12 decembrie 2016 14:37:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <algorithm>
#include <bitset>
using namespace std;
bitset<2000003>a;
int main()
{
int n,cnt,i,j;
ifstream fin("ciur.in");
ofstream fout("ciut.out");
fin>>n;
a[i]=1;
for(i=2;i*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;
}