Cod sursa(job #2443949)
Utilizator | Data | 29 iulie 2019 20:26:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
const int Nmax = 2000000+1;
bool v[Nmax];
int n,prime;
int main()
{
in>>n;
for(int i=2;i*i<=n;++i)
{
if(!v[i])
{
for(int j=i+i;j<=n;j+=i)
v[j]=1;
}
}
for(int i=2;i<=n;i++)
if(!v[i])
prime++;
out<<prime;
return 0;
}