Cod sursa(job #1780505)
Utilizator | Data | 16 octombrie 2016 12:20:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
bitset<2000005> v;
int main()
{
int nr,i,j,n;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
nr=0;
//*
for (i=2;i<=n;i++)
{
if (v[i]==0)
{
++nr;
for(j=i*i;j<=n;j+=i)
v[j]=1;
}
}
//*/
fout<<nr;
return 0;
}