Cod sursa(job #2164468)
| Utilizator | Data | 13 martie 2018 00:10:57 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset <2000002> v;
int n, i, j, k;
int main()
{
v[0]=v[1]=1;
for (i=2; i*i<=2000000; i++)
if (v[i]==0)
for (j=i*i; j<=2000000; j+=i) v[j]=1;
fin >> n;
for (i=1; i<=n; i++)
if (v[i]==0) k++;
fout << k;
return 0;
}
