Cod sursa(job #2297221)
Utilizator | Data | 5 decembrie 2018 16:23:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool v[2000000];
int main()
{
long long c=0, n, i, i2;
in >> n;
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i])
{
c++;
for(i2=2*i;i2<=n;i2+=i)
v[i2]=0;
}
out << c;
return 0;
}