Cod sursa(job #2266240)
Utilizator | Data | 22 octombrie 2018 15:22:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <bitset>
using namespace std;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset <2000000> ciur;
ciur.set();
int n,cnt=0;
fin>>n;
for(int i=2; i<=n; i++)
if(ciur[i]) for(int j=i+i; j<=n; j=j+i)
ciur[j]=0;
for(int i=2; i<=n; i++)
if(ciur[i]) cnt++;
fout<<cnt;
return 0;
}