Cod sursa(job #2384691)
| Utilizator | Data | 21 martie 2019 09:18:06 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int VM=2000001;
bool c[VM];
int main()
{
int n,i,j,nrprime=0;
in>>n;
c[1]=false;
for(i=2;i*i<=n;i++)
{
if(!c[i])
{
for(j=i*i;j<=n;j+=i)
{
c[j]=true;
}
}
}
for(i=2;i<=n;i++)
{
if(c[i]==false)
nrprime++;
}
out<<nrprime;
return 0;
}
