Cod sursa(job #2171092)
Utilizator | Data | 15 martie 2018 11:14:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bitset <2000010>c;
int n, nr, i, j;
int main ()
{
fin >> n;
nr = 0;
c[1] = 1;
for (i=2; i<=n; i++)
{
if(c[i] == 0)
{
nr++;
for(j=2*i; j<=n; j+=i)
c[j]=1;
}
}
fout << nr;
}