Cod sursa(job #2184590)
Utilizator | Data | 24 martie 2018 10:01:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int N = 2000001;
bool c[N];
int main()
{
int n,nr=0;
in>>n;
for(int i=2;i*i<=n;i++)
{
if(!c[i])
{
for(int j=i*i;j<=n;j+=i)
{
c[j]=true;
}
}
}
for(int i=2;i<=n;i++)
{
if(!c[i])
{
nr++;
}
}
out<<nr;
return 0;
}