Cod sursa(job #2601342)
Utilizator | Data | 14 aprilie 2020 12:53:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
const int NN = 2000000;
bitset <NN+5> ciur;
int i,N,cnt,j;
int main()
{
f>>N;
for(i=2;i<=N;i++)
if(ciur[i]==0)
{
cnt++;
for(j=2*i;j<=N;j+=i) ciur[j]=1;
}
g<<cnt;
f.close();
g.close();
return 0;
}